{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:27Z","timestamp":1725558747852},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139611"},{"type":"electronic","value":"9783642139628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_11","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"98-107","source":"Crossref","is-referenced-by-count":0,"title":["The Limits of Tractability in Resolution-Based Propositional Proof Systems"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"311","volume-title":"Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA","author":"S. Dantchev","year":"2007","unstructured":"Dantchev, S.: Rank complexity gap for Lov\u00e1sz-Schrijver and Sherali-Adams proof systems. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, pp. 311\u2013317. ACM, New York (2007)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-45220-1_14","volume-title":"Computer Science Logic","author":"S. Dantchev","year":"2003","unstructured":"Dantchev, S., Riis, S.: On relativisation and complexity gap for resolution-based proof systems. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 142\u2013154. Springer, Heidelberg (2003)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u0109ek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511529948"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.4064\/fm170-1-8","volume":"170","author":"J. Kraj\u00ed\u0109ek","year":"2001","unstructured":"Kraj\u00ed\u0109ek, J.: On the weak pigeonhole principle. Fundamenta Mathematica\u00a0170, 123\u2013140 (2001)","journal-title":"Fundamenta Mathematica"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: Proofs as games. American Mathematical Monthly (June-July 2000)","DOI":"10.1080\/00029890.2000.12005233"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Riis, S.: A complexity gap for tree-resolution. Computational Complexity\u00a010 (2001)","DOI":"10.1007\/s00037-001-8194-y"}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:47Z","timestamp":1619785007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}