{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:46:16Z","timestamp":1725479176049},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_10","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T21:56:25Z","timestamp":1279144585000},"page":"135-142","source":"Crossref","is-referenced-by-count":4,"title":["Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution"],"prefix":"10.1007","author":[{"given":"Edward A.","family":"Hirsch","sequence":"first","affiliation":[]},{"given":"Sergey I.","family":"Nikolenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"267","volume":"62","author":"S. Buss","year":"2001","unstructured":"Buss, S., Grigoriev, D., Impagliazzo, R., Pitassi, T.: Linear gaps between degrees for the polynomial calculus modulo distinct primes. JCSS\u00a062, 267\u2013289 (2001)","journal-title":"JCSS"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow \u2013 resolution made simple. JACM\u00a048(2) (2001)","DOI":"10.1145\/375827.375835"},{"issue":"1","key":"10_CR3","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. The Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Dash, S.: Exponential lower bounds on the lengths of some classes of branch-and-cut proofs. IBM Research Report RC22575 (September 2002)","DOI":"10.1007\/3-540-47867-1_11"},{"issue":"4","key":"10_CR5","doi-asserted-by":"crossref","first-page":"647","DOI":"10.17323\/1609-4514-2002-2-4-647-679","volume":"2","author":"D. Grigoriev","year":"2002","unstructured":"Grigoriev, D., Hirsch, E.A., Pasechnik, D.V.: Complexity of semialgebraic proofs. Moscow Mathematical Journal\u00a02(4), 647\u2013679 (2002)","journal-title":"Moscow Mathematical Journal"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0023762","volume-title":"Computer Science Logic","author":"A. Goerdt","year":"1992","unstructured":"Goerdt, A.: The Cutting Plane proof system with bounded degree of falsity. In: Kleine B\u00fcning, H., J\u00e4ger, G., B\u00f6rger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol.\u00a0626, pp. 119\u2013133. Springer, Heidelberg (1992)"},{"key":"10_CR7","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\u2013308 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization\u00a01(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optimization"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P. Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic\u00a062(3), 981\u2013998 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR10","first-page":"1033","volume":"282","author":"A.A. Razborov","year":"1985","unstructured":"Razborov, A.A.: Lower bounds on the monotone complexity of some boolean functions. Doklady Akad. Nauk SSSR\u00a0282, 1033\u20131037 (1985)","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"10_CR11","first-page":"77","volume":"3","author":"J.A. Robinson","year":"1968","unstructured":"Robinson, J.A.: The generalized resolution principle. Machine Intelligence\u00a03, 77\u201394 (1968)","journal-title":"Machine Intelligence"},{"key":"10_CR12","first-page":"234","volume":"8","author":"G.S. Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of derivation in the propositional calculus. Zapiski nauchnykh seminarov LOMI\u00a08, 234\u2013259 (1968); English translation of this volume: Consultants Bureau, N.Y., pp.\u00a0115\u2013125 (1970)","journal-title":"Zapiski nauchnykh seminarov LOMI"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A. Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. JACM\u00a034(1), 209\u2013219 (1987)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:52Z","timestamp":1605643252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11499107_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}