{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:45:24Z","timestamp":1794339924600,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_17","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"147-158","source":"Crossref","is-referenced-by-count":4,"title":["Relativisation Provides Natural Separations for Resolution-Based Proof Systems"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Atserias, A., Bonet, M.: On the automatizability of resolution and related propositional proof systems. In: 16th Annual Conference of the European Association for Computer Science Logic (2002)","DOI":"10.1007\/3-540-45793-3_38"},{"key":"17_CR2","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"},{"key":"17_CR3","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.) EACSL 2003. LNCS, vol.\u00a02803, pp. 142\u2013154. Springer, Heidelberg (2003)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Esteban, J.L., Galesi, N., Mesner, J.: On the complexity of resolution with bounded conjunctions. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (2002)","DOI":"10.1007\/3-540-45465-9_20"},{"key":"17_CR5","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":"17_CR6","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":"17_CR7","doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u0109ek, J.: Combinatorics of first order structures and propositional proof systems. Archive for Mathematical Logic\u00a043(4) (2004)","DOI":"10.1007\/s00153-003-0186-y"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: Proofs as games. American Mathematical Monthly, 541\u2013550 (June-July 2000)","DOI":"10.1080\/00029890.2000.12005233"},{"key":"17_CR9","unstructured":"Razborov, A.: Pseudorandom generators hard for k \u2013 dnf resolution and polynomial calculus resolution (2002\u20132003)"},{"key":"17_CR10","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"},{"issue":"6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1093\/jigpal\/8.6.787","volume":"8","author":"S.M. Riis","year":"2000","unstructured":"Riis, S.M., Sitharam, M.: Generating Hard Tautologies Using Predicate Logic and the Symmetric Group. Logic Journal of the IGPL\u00a08(6), 787\u2013795 (2000)","journal-title":"Logic Journal of the IGPL"},{"key":"17_CR12","volume-title":"Proceedings of the 43rd annual symposium on Foundations Of Computer Science","author":"N. Segerlind","year":"2002","unstructured":"Segerlind, N., Buss, S., Impagliazzo, R.: A switching lemma for small restrictions and lower bounds for k-dnf resolution. In: Proceedings of the 43rd annual symposium on Foundations Of Computer Science, IEEE, Los Alamitos (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:30Z","timestamp":1619492610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11753728_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}