{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:51:02Z","timestamp":1744217462015},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_14","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"142-154","source":"Crossref","is-referenced-by-count":12,"title":["On Relativisation and Complexity Gap for Resolution-Based Proof Systems"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[]},{"given":"S\u00f8ren","family":"Riis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00037-001-8194-y","volume":"10","author":"S. Riis","year":"2001","unstructured":"Riis, S.: A complexity gap for tree-resolution. Computational Complexity\u00a010, 179\u2013209 (2001)","journal-title":"Computational Complexity"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near-optimal separation of general and tree-like resolution. Combinatorica (to appear)","DOI":"10.1007\/s00493-004-0036-5"},{"key":"14_CR3","volume-title":"Proceedings of the 40th IEEE Symposium on Foundations of Computer Science","author":"M. Bonet","year":"1999","unstructured":"Bonet, M., Galesi, N.: A study of proof search algorithms for resolution and polynomial calculus. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos (1999)"},{"key":"14_CR4","unstructured":"Krajicek, J.: Combinatorics of first order structures and propositional proof systems (2001)"},{"key":"14_CR5","volume-title":"Proceedings of the 16th annual IEEE Conference on Comutational Complexity","author":"S. Dantchev","year":"2001","unstructured":"Dantchev, S., Riis, S.: Tree resolution proofs of the weak pigeon-hole principle. In: Proceedings of the 16th annual IEEE Conference on Comutational Complexity, IEEE, Los Alamitos (2001)"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: Proofs as games. American Mathematical Monthly, 541\u2013550 (2000)","DOI":"10.1080\/00029890.2000.12005233"},{"key":"14_CR8","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"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Beame, P., Pitassi, T.: Simplified and improved resolution lower bounds. In: Proceedings of the 37th annual IEEE symposium on Foundation of Computer Science, pp. 274\u2013282 (1996)","DOI":"10.1109\/SFCS.1996.548486"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T23:04:32Z","timestamp":1552604672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}