{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T08:46:08Z","timestamp":1773996368739,"version":"3.50.1"},"reference-count":23,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4089,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1995,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove lower bounds of the form exp(<jats:italic>n<\/jats:italic><jats:sup>\u03b5 d<\/jats:sup>), \u03b5<jats:italic><jats:sub>d<\/jats:sub><\/jats:italic> &gt; 0, on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth <jats:italic>d<\/jats:italic>, for any constant <jats:italic>d.<\/jats:italic> This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.<\/jats:p>","DOI":"10.1002\/rsa.3240070103","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T18:49:35Z","timestamp":1180205375000},"page":"15-39","source":"Crossref","is-referenced-by-count":96,"title":["An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle"],"prefix":"10.1002","volume":"7","author":[{"given":"Jan","family":"Kraj\u00ed\u010dek","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[]},{"given":"Alan","family":"Woods","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(83)90038-6"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"M.Ajtai The complexity of the pigeonhole principle 29th Annual Symp. on the Foundations of Computer Science 1988 pp.346\u2013355.","DOI":"10.1109\/SFCS.1988.21951"},{"key":"e_1_2_1_4_2","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1991"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"P.Beame R.Impagliazzo J.Kraj\u00ed\u010dek T.Pitassi P.Pudl\u00e1kandA.Woods Exponential lower bound for the pigeonhole principle Proc. 24th Annual ACM Symp. on Theory of Computing 1992 pp.200\u2013221.","DOI":"10.1145\/129712.129733"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0221068"},{"key":"e_1_2_1_7_2","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"1985"},{"key":"e_1_2_1_8_2","volume-title":"Bounded Arithmetic","author":"Buss S. R.","year":"1986"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/2273826"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"J.Cai With probability one a random oracle separates PSPACE from the polynomial\u2010time hierarchy Proc. 18th Annual ACM Symp. on Theory of Computing 1986 pp.21\u201329.","DOI":"10.1145\/12130.12133"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"S. A.Cook The complexity of theorem proving procedures 3rd Symp. on Theory of Comput. 1971 pp.151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-22156-3"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_2_1_15_2","first-page":"143","volume-title":"Advances in Computer Research","author":"H\u00e5stad J.","year":"1989"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.2307\/2275250"},{"key":"e_1_2_1_17_2","volume-title":"Bounded Arithmetic, Propositional Logic and Complexity Theory","author":"Kraj\u00ed\u010dek J."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0075316"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.2307\/2274618"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200117"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","unstructured":"G. S.Tseitin On the complexity of derivations in the propositional calculus inStudies in Mathematics and Mathematical Logic Part II A. O. Silsenko Ed. 1968 pp.115\u2013125;","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"e_1_2_1_21_3","volume-title":"Automation of Reasoning","author":"Siebemann J.","year":"1983"},{"key":"e_1_2_1_22_2","unstructured":"A.Woods Some problems in logic and number theory and their connections Ph.D. thesis Manchester University 1981."},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","unstructured":"A.Yao Separating the polynomial\u2010time hierarchy by oracles Proc. 26th Annual IEEE Symp. on Foundations of Computer Science 1985 pp.1\u201310.","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240070103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240070103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T05:37:53Z","timestamp":1698298673000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240070103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["10.1002\/rsa.3240070103"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240070103","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}