{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T06:34:18Z","timestamp":1721025258344},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00037-010-0001-1","type":"journal-article","created":{"date-parts":[[2011,4,4]],"date-time":"2011-04-04T08:35:52Z","timestamp":1301906152000},"page":"51-85","source":"Crossref","is-referenced-by-count":11,"title":["Parameterized Proof Complexity"],"prefix":"10.1007","volume":"20","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,5]]},"reference":[{"key":"1_CR1","unstructured":"Samuel Buss & Tonian Pitassi (1998). Resolution and the weak pigeonhole principle. In: CSL \u201997, LNCS 1414, 149\u2013156. Springer Verlag."},{"key":"1_CR2","unstructured":"Marco Cesati (2006). Compendium of Parameterized problems. http:\/\/bravo.ce.uniroma2.it\/home\/cesati\/research\/compendium\/ ."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Jianer Chen, Iyad A. Kanj & Ge Xia (2006). Improved Parameterized Upper Bounds for Vertex Cover. In: Proceedings of MFCS 2006, LNCS 4162, 238\u2013249. Springer Verlag.","DOI":"10.1007\/11821069_21"},{"issue":"1","key":"1_CR4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"Cook Stephen","year":"1979","unstructured":"Stephen Cook, Robert Reckhow (1979) The relative efficiency of propositional proof systems. J. Symbolic Logic 44(1): 36\u201350","journal-title":"J. Symbolic Logic"},{"key":"1_CR5","unstructured":"Rodney G. Downey & Michael R. Fellows (1999). Parameterized Complexity. Monographs in Computer Science. Springer Verlag."},{"key":"1_CR6","unstructured":"J\u00f6rg Flum & Martin Grohe (2006). Parameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Springer Verlag."},{"issue":"4","key":"1_CR7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"Impagliazzo Russell","year":"2001","unstructured":"Russell Impagliazzo, Ramamohan Paturi, Francis Zane (2001) Which problems have strongly exponential complexity. J. of Computer and System Sciences 63(4): 512\u2013530","journal-title":"J. of Computer and System Sciences"},{"key":"1_CR8","unstructured":"Jan Kraj\u00ed\u010dek (1995). Bounded arithmetic, propositional logic, and complexity theory. Cambridge University Press, New York, NY, USA. ISBN 0-521-45205-8."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Rolf Niedermeier (2006). Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"6","key":"1_CR10","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2307\/2589349","volume":"107","author":"Pudl\u00e1k Pavel","year":"2000","unstructured":"Pavel Pudl\u00e1k (2000) Proofs as Games. American Mathematical Monthly 107(6): 541\u2013550","journal-title":"American Mathematical Monthly"},{"issue":"10","key":"1_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00037-001-8194-y","volume":"3","author":"Riis Soren","year":"2001","unstructured":"Soren Riis (2001) A complexity gap for tree-resolution. Computational Complexity 3(10): 179\u2013209","journal-title":"Computational Complexity"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-010-0001-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-010-0001-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-010-0001-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T17:07:32Z","timestamp":1560100052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-010-0001-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s00037-010-0001-1","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}