{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:46:36Z","timestamp":1743079596814,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_15","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"257-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bound for Torus Polynomials"],"prefix":"10.1007","author":[{"given":"Vaibhav","family":"Krishan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: $$\\varSigma $$$$_{1}^{1}$$- formulae on finite structures. Ann. Pure Appl. Logic 24(1), 1\u201348 (1983)","DOI":"10.1016\/0168-0072(83)90038-6"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-54458-5_44","volume-title":"Fundamentals of Computation Theory","author":"E Allender","year":"1991","unstructured":"Allender, E., Gore, V.: On strong separations from $$\\sf AC^0$$. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 1\u201315. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54458-5_44"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in $${\\sf NC}^1$$. J. Comput. Syst. Sci. 38(1), 150\u2013164 (1989)","DOI":"10.1016\/0022-0000(89)90037-8"},{"key":"15_CR4","unstructured":"Beigel, R., Tarui, J.: On $${\\sf ACC}$$ (circuit complexity). In: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp. 783\u2013792. IEEE (1991)"},{"key":"15_CR5","unstructured":"Bhrushundi, A., Hosseini, K., Lovett, S., Rao, S.: Torus polynomials: an algebraic approach to $${\\sf ACC}$$ lower bounds. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, A., Mande, N.: A short list of equalities induces large sign rank. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 47\u201358. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00014"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L.: Non-deterministic quasi-polynomial time is average-case hard for $${\\sf ACC}$$ circuits. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1281\u20131304. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00079"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-319-77404-6_24","volume-title":"LATIN 2018: Theoretical Informatics","author":"R Chen","year":"2018","unstructured":"Chen, R., Oliveira, I.C., Santhanam, R.: An average-case lower bound against\u00a0$$\\sf ACC^0$$. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 317\u2013330. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_24"},{"key":"15_CR9","unstructured":"Chen, R., Santhanam, R., Srinivasan, S.: Average-case lower bounds and satisfiability algorithms for small threshold circuits. arXiv preprint arXiv:1806.06290 (2018)"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17(1), 13\u201327 (1984)","journal-title":"Math. Syst. Theory"},{"key":"15_CR11","unstructured":"Green, F., K\u00f6bler, J., Tor\u00e1n, J.: The power of the middle bit. In: [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pp. 111\u2013117. IEEE (1992)"},{"key":"15_CR12","unstructured":"H\u00e5stad, J.: Computational Limitations of Small-Depth Circuits. MIT press, Cambridge (1987)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Williams, R.: Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. In: Proceedings of the Forty-Eighth Annual ACM symposium on Theory of Computing, pp. 633\u2013643 (2016)","DOI":"10.1145\/2897518.2897636"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Murray, C., Williams, R.: Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for $${\\sf NP}$$ and $${\\sf NQP}$$. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 890\u2013901 (2018)","DOI":"10.1145\/3188745.3188910"},{"issue":"4","key":"15_CR15","first-page":"333","volume":"41","author":"AA Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathe. Notes Acad. Sci. USSR 41(4), 333\u2013338 (1987)","journal-title":"Mathe. Notes Acad. Sci. USSR"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Williams, R.: New algorithms and lower bounds for circuits with linear threshold gates. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 194\u2013202 (2014)","DOI":"10.1145\/2591796.2591858"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Williams, R.: Nonuniform $${\\sf ACC}$$ circuit lower bounds. J. ACM (JACM) 61(1), 1\u201332 (2014)","DOI":"10.1145\/2559903"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Separating the polynomial-time hierarchy by oracles. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 1\u201310. IEEE (1985)","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:21:57Z","timestamp":1623972117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}