{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:08:38Z","timestamp":1759147718003},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_52","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"618-629","source":"Crossref","is-referenced-by-count":0,"title":["Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Filmus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toniann","family":"Pitassi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"52_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/060664537","volume":"38","author":"E. Allender","year":"2008","unstructured":"Allender, E., Hellerstein, L., McCabe, P., Pitassi, T., Saks, M.: Minimizing disjunctive normal form formulas and AC0 circuits given a truth table. SIAM Journal on Computing\u00a038(1), 63\u201384 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"52_CR2","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.ic.2011.01.003","volume":"209","author":"A. Atserias","year":"2011","unstructured":"Atserias, A., Maneva, E.: Mean-payoff games and propositional proofs. Inf. and Comp.\u00a0209(4), 664\u2013691 (2011)","journal-title":"Inf. and Comp."},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Beame, P.W., Impagliazzo, R., Kraj\u00ed\u010dek, J., Pitassi, T., Pudl\u00e1k, P., Woods, A.: Exponential lower bounds for the pigeonhole principle. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Computing, Victoria, B.C., Canada, pp. 200\u2013220 (May 1992)","DOI":"10.1145\/129712.129733"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-1-4612-2566-9_3","volume-title":"Feasible Mathematics II","author":"M.L. Bonet","year":"1995","unstructured":"Bonet, M.L., Buss, S.R., Pitassi, T.: Are there hard examples for Frege systems? In: Feasible Mathematics II, pp. 30\u201356. Birkh\u00e4user, Basel (1995)"},{"issue":"1-2","key":"52_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00037-004-0183-5","volume":"13","author":"M.L. Bonet","year":"2004","unstructured":"Bonet, M.L., Domingo, C., Gavald\u00e0, R., Maciel, A., Pitassi, T.: Non-automatizability of bounded-depth Frege proofs. Computational Complexity\u00a013(1-2), 47\u201368 (2004)","journal-title":"Computational Complexity"},{"issue":"6","key":"52_CR6","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1137\/S0097539798353230","volume":"29","author":"M.L. Bonet","year":"2000","unstructured":"Bonet, M.L., Pitassi, T., Raz, R.: On interpolation and automatization for Frege systems. SIAM Journal on Computing\u00a029(6), 1939\u20131967 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"916","DOI":"10.2307\/2273826","volume":"57","author":"S.R. Buss","year":"1987","unstructured":"Buss, S.R.: Polynomial size proofs of the pigeonhole principle. Journal of Symbolic Logic\u00a057, 916\u2013927 (1987)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"52_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"Journal of Symbolic Logic"},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theoretical Computer Science\u00a039, 297\u2013305 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"52_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2275250","volume":"59","author":"J. Kraj\u00ed\u010dek","year":"1994","unstructured":"Kraj\u00ed\u010dek, J.: Lower bounds to the size of constant-depth propositional proofs. Journal of Symbolic Logic\u00a059(1), 73\u201386 (1994)","journal-title":"Journal of Symbolic Logic"},{"key":"52_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded arithmetic, propositional logic, and complexity theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded arithmetic, propositional logic, and complexity theory. Cambridge University Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:48:02Z","timestamp":1560289682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}