{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:33:21Z","timestamp":1760146401551,"version":"3.44.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0304-3975(88)90072-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"311-317","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":59,"title":["Resolution proofs of generalized pigeonhole principles"],"prefix":"10.1016","volume":"62","author":[{"given":"Samuel R.","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u0151rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90072-2_BIB1","doi-asserted-by":"crossref","first-page":"916","DOI":"10.2307\/2273826","article-title":"Polynomial size proofs of the propositional pigeonhole principle","volume":"52","author":"Buss","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(88)90072-2_BIB2","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":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(88)90072-2_BIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","article-title":"On the complexity of cutting plane proofs","volume":"18","author":"Cook","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(88)90072-2_BIB4","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\/0304-3975(88)90072-2_BIB5","series-title":"Methods in Mathematical Logic","first-page":"317","article-title":"Counting problems in Bounded Arithmetic","volume":"1130","author":"Paris","year":"1985"},{"key":"10.1016\/0304-3975(88)90072-2_BIB6","unstructured":"J.B. Paris, A.J. Wilkie and A.R. Woods, Provability of the pigeonhole principle and the existence of infinitely many primes, J. Symbolic Logic, to appear."},{"key":"10.1016\/0304-3975(88)90072-2_BIB7","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. Assoc. Comput. Mach."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900722?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900722?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:18Z","timestamp":1757477898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0304397588900722"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90072-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Resolution proofs of generalized pigeonhole principles","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(88)90072-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}