{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:45:31Z","timestamp":1777682731380,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319774039","type":"print"},{"value":"9783319774046","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_24","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"317-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An Average-Case Lower Bound Against\u00a0$$\\mathsf {ACC}^0$$"],"prefix":"10.1007","author":[{"given":"Ruiwen","family":"Chen","sequence":"first","affiliation":[]},{"given":"Igor C.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"24_CR1","unstructured":"TCS Stack Exchange: How powerful is $$\\sf ACC^0$$ circuit class in average case? https:\/\/cstheory.stackexchange.com\/q\/37232. Accessed 27 Sept 2017"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M Ajtai","year":"1983","unstructured":"Ajtai, M.: $$\\varSigma ^{1}_{1}$$-formulae on finite structures. Ann. Pure Appl. Logic 24(1), 1\u201348 (1983). https:\/\/doi.org\/10.1016\/0168-0072(83)90038-6","journal-title":"Ann. Pure Appl. Logic"},{"key":"24_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Complexity Theory: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Complexity Theory: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"24_CR4","unstructured":"Buresh-Oppenheim, J., Kabanets, V., Santhanam, R.: Uniform hardness amplification in NP via monotone codes. In: Electronic Colloquium on Computational Complexity (ECCC) TR06-154 (2006). https:\/\/eccc.weizmann.ac.il\/eccc-reports\/2006\/TR06-154\/"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Carmosino, M.L., Impagliazzo, R., Kabanets, V., Kolokolova, A.: Learning algorithms from natural proofs. In: Conference on Computational Complexity (CCC), pp. 10:1\u201310:24 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2016.10","DOI":"10.4230\/LIPIcs.CCC.2016.10"},{"key":"24_CR6","unstructured":"Chen, R., Oliveira, I.C., Santhanam, R.: An average-case lower bound against ACC$$^0$$. In: Electronic Colloquium on Computational Complexity (ECCC) TR17-173 (2017). https:\/\/eccc.weizmann.ac.il\/report\/2017\/173\/"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"809","DOI":"10.4086\/toc.2013.v009a026","volume":"9","author":"B Fefferman","year":"2013","unstructured":"Fefferman, B., Shaltiel, R., Umans, C., Viola, E.: On beating the hybrid argument. Theory Comput. 9, 809\u2013843 (2013). https:\/\/doi.org\/10.4086\/toc.2013.v009a026","journal-title":"Theory Comput."},{"issue":"1","key":"24_CR8","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). https:\/\/doi.org\/10.1007\/BF01744431","journal-title":"Math. Syst. Theory"},{"key":"24_CR9","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., Rothblum, G.N.: Verifying and decoding in constant depth. In: Symposium on Theory of Computing (STOC), pp. 440\u2013449 (2007). https:\/\/doi.org\/10.1145\/1250790.1250855","DOI":"10.1145\/1250790.1250855"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-85363-3_36","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"D Gutfreund","year":"2008","unstructured":"Gutfreund, D., Rothblum, G.N.: The complexity of local list decoding. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM -2008. LNCS, vol. 5171, pp. 455\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_36"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small depth circuits. In: Symposium on Theory of Computing (STOC), pp. 6\u201320 (1986). https:\/\/doi.org\/10.1145\/12130.12132","DOI":"10.1145\/12130.12132"},{"key":"24_CR12","unstructured":"Impagliazzo, R., Kabanets, V., Volkovich, I.: The power of natural properties as oracles. In: Electronic Colloquium on Computational Complexity (ECCC) TR17-023 (2017). https:\/\/eccc.weizmann.ac.il\/report\/2017\/023\/"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80043-1","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR14","doi-asserted-by":"publisher","unstructured":"Oliveira, I.C., Santhanam, R.: Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomness. In: Computational Complexity Conference (CCC), pp. 18:1\u201318:49 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2017.18","DOI":"10.4230\/LIPIcs.CCC.2017.18"},{"key":"24_CR15","doi-asserted-by":"publisher","unstructured":"Oliveira, I.C., Santhanam, R.: Pseudodeterministic constructions in subexponential time. In: Symposium on Theory of Computing (STOC), pp. 665\u2013677 (2017). https:\/\/doi.org\/10.1145\/3055399.3055500","DOI":"10.1145\/3055399.3055500"},{"issue":"4","key":"24_CR16","first-page":"333","volume":"41","author":"AA Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded-depth networks over the complete basis with logical addition. Math. Notes Acad. Sci. USSR 41(4), 333\u2013338 (1987)","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"24_CR17","unstructured":"Servedio, R., Tan, L.Y.: What circuit classes can be learned with non-trivial savings? In: Innovations in Theoretical Computer Science Conference (ITCS), pp. 1\u201323 (2017)"},{"issue":"7","key":"24_CR18","doi-asserted-by":"publisher","first-page":"3122","DOI":"10.1137\/080735096","volume":"39","author":"R Shaltiel","year":"2010","unstructured":"Shaltiel, R., Viola, E.: Hardness amplification proofs require majority. SIAM J. Comput. 39(7), 3122\u20133154 (2010). https:\/\/doi.org\/10.1137\/080735096","journal-title":"SIAM J. Comput."},{"key":"24_CR19","doi-asserted-by":"publisher","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Symposium on Theory of Computing (STOC), pp. 77\u201382 (1987). https:\/\/doi.org\/10.1145\/28395.28404","DOI":"10.1145\/28395.28404"},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Srinivasan, S.: On improved degree lower bounds for polynomial approximation. In: Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 201\u2013212 (2013). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2013.201","DOI":"10.4230\/LIPIcs.FSTTCS.2013.201"},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.P.: Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci. 62(2), 236\u2013266 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1730","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"24_CR22","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/2559903","volume":"61","author":"R Williams","year":"2014","unstructured":"Williams, R.: Nonuniform ACC circuit lower bounds. J. ACM 61(1), 2:1\u20132:32 (2014). https:\/\/doi.org\/10.1145\/2559903","journal-title":"J. ACM"},{"issue":"2","key":"24_CR23","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1137\/130938219","volume":"45","author":"R Williams","year":"2016","unstructured":"Williams, R.: Natural proofs versus derandomization. SIAM J. Comput. 45(2), 497\u2013529 (2016). https:\/\/doi.org\/10.1137\/130938219","journal-title":"SIAM J. Comput."},{"key":"24_CR24","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Separating the polynomial-time hierarchy by oracles (preliminary version). In: Symposium on Foundations of Computer Science (FOCS), pp. 1\u201310 (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.49","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:02:23Z","timestamp":1709827343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}