{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:08:47Z","timestamp":1762099727776},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0168-0072(96)83747-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:29:52Z","timestamp":1027657792000},"page":"195-228","source":"Crossref","is-referenced-by-count":15,"title":["An exponential separation between the parity principle and the pigeonhole principle"],"prefix":"10.1016","volume":"80","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[]},{"given":"Toniann","family":"Pitassi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(96)83747-X_BIB1","series-title":"Proc. 29th Ann. Symp. on Foundations of Computer Science","first-page":"346","article-title":"The complexity of the pigeonhole principle","author":"Ajtai","year":"1988"},{"key":"10.1016\/0168-0072(96)83747-X_BIB2","series-title":"Feasible Mathematics, A Mathematical Sciences Institute Workshop","first-page":"1","article-title":"Parity and the pigeonhole principle","author":"Ajtai","year":"1990"},{"key":"10.1016\/0168-0072(96)83747-X_BIB3","series-title":"Proc. 27th Ann. ACM Symp. on Theory of Computing","first-page":"303","article-title":"The complexity of NP search porblems","author":"Beame","year":"1995"},{"key":"10.1016\/0168-0072(96)83747-X_BIB4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0168-0072(96)83747-X_BIB5","series-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing","first-page":"200","article-title":"Exponential lower bounds for the pigeonhole principle","author":"Beame","year":"1992"},{"key":"10.1016\/0168-0072(96)83747-X_BIB6","series-title":"Proc. 8th Ann. IEEE Symp. on Logic in Computer Science","article-title":"An exponential separation between the matching principle and the pigeonhole principle","author":"Beame","year":"1993"},{"key":"10.1016\/0168-0072(96)83747-X_BIB7","series-title":"Proc. Structure in Complexity Theory, 6th Ann. Conf.","first-page":"367","article-title":"Approximation and small depth Frege proofs","author":"Bellantoni","year":"1991"},{"key":"10.1016\/0168-0072(96)83747-X_BIB8","article-title":"Studies in Proof Theory","volume":"Vol. 3","author":"Buss","year":"1986"},{"key":"10.1016\/0168-0072(96)83747-X_BIB9","doi-asserted-by":"crossref","first-page":"916","DOI":"10.2307\/2273826","article-title":"Polynomial size proofs of the pigeonhole principle","volume":"57","author":"Buss","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(96)83747-X_BIB10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(96)83747-X_BIB11","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(96)83747-X_BIB12_1","series-title":"Computational Limitations of Small-Depth Circuits","author":"H\u00e5stad","year":"1987"},{"key":"10.1016\/0168-0072(96)83747-X_BIB12_2","author":"H\u00e5stad","year":"1986","journal-title":"ACM Doctoral Dissertation Award Series"},{"key":"10.1016\/0168-0072(96)83747-X_BIB13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/rsa.3240070103","article-title":"Exponential lower bounds to the size of bounded-depth Frege proofs of the pigeonhole principle","volume":"7","author":"Kraj\u00ed\u010dek","year":"1995","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0168-0072(96)83747-X_BIB14","series-title":"Proc. 4th Czechoslovakian Symp. on Combinatorics","article-title":"On inefficient proofs of existence and complexity classes","author":"Papadimitriou","year":"1991"},{"key":"10.1016\/0168-0072(96)83747-X_BIB15","article-title":"The power of weak formal systems","author":"Pitassi","year":"1992"},{"key":"10.1016\/0168-0072(96)83747-X_BIB16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01200117","article-title":"Exponential lower bounds for the pigeonhole principle","volume":"3","author":"Pitassi","year":"1993","journal-title":"Comput. Complexity"},{"key":"10.1016\/0168-0072(96)83747-X_BIB17","series-title":"Methods in Mathematical Logic: Proc. 6th Latin American Symposium on Mathematical Logic","first-page":"317","article-title":"Counting problems in bounded arithmetic","volume":"Vol. 1130","author":"Paris","year":"1985"},{"key":"10.1016\/0168-0072(96)83747-X_BIB18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","article-title":"Hard examples for resolution","volume":"34","author":"Urquhart","year":"1987","journal-title":"J. ACM"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729683747X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729683747X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:54:47Z","timestamp":1555059287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729683747X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["016800729683747X"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(96)83747-x","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}