{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:30Z","timestamp":1725728370574},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_12","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"139-149","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Resolution with Bounded Conjunction"],"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":"12_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"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1006\/inco.2002.3114","volume":"176","author":"A. Atserias","year":"2002","unstructured":"Atserias, A., Bonet, M.L., Esteban, J.L.: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution. Inf. Comput.\u00a0176(2), 136\u2013152 (2002)","journal-title":"Inf. Comput."},{"key":"12_CR3","unstructured":"Beyersdorff, O., Galesi, N., Lauria, M.: Hardness of parameterized resolution. Technical report, ECCC (2010)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-21581-0_3","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"O. Beyersdorff","year":"2011","unstructured":"Beyersdorff, O., Galesi, N., Lauria, M.: Parameterized complexity of DPLL search procedures. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 5\u201318. Springer, Heidelberg (2011)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-642-22006-7_53","volume-title":"Automata, Languages and Programming","author":"O. Beyersdorff","year":"2011","unstructured":"Beyersdorff, O., Galesi, N., Lauria, M., Razborov, A.: Parameterized bounded-depth frege is not optimal. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 630\u2013641. Springer, Heidelberg (2011)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S. Cook","year":"1979","unstructured":"Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11753728_17","volume-title":"Computer Science \u2013 Theory and Applications","author":"S. Dantchev","year":"2006","unstructured":"Dantchev, S.: Relativisation provides natural separations for resolution-based proof systems. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 147\u2013158. Springer, Heidelberg (2006)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Dantchev, S., Martin, B., Szeider, S.: Parameterized proof complexity. In: 48th IEEE Symp. on Foundations of Computer Science, pp. 150\u2013160 (2007)","DOI":"10.1109\/FOCS.2007.53"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Dantchev, S., Martin, B., Szeider, S.: Parameterized proof complexity. Computational Complexity\u00a020 (2011)","DOI":"10.1007\/s00037-010-0001-1"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-45465-9_20","volume-title":"Automata, Languages and Programming","author":"J.L. Esteban","year":"2002","unstructured":"Esteban, J.L., Galesi, N., Messner, J.: On the complexity of resolution with bounded conjunctions. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 220. Springer, Heidelberg (2002)"},{"key":"12_CR12","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science, vol.\u00a0XIV. An EATCS Series. Springer (2006)"},{"key":"12_CR13","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, 170, 123\u2013140 (2001)","journal-title":"Fundamenta Mathematica"},{"key":"12_CR14","unstructured":"Martin, B.: Parameterized proof complexity and W[1]. CoRR: arxiv.org\/abs\/1203.5323 (2012)"},{"key":"12_CR15","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"},{"issue":"5","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/S0097539703428555","volume":"33","author":"N. Segerlind","year":"2004","unstructured":"Segerlind, N., Buss, S.R., Impagliazzo, R.: A switching lemma for small restrictions and lower bounds for k-dnf resolution. SIAM J. Comput.\u00a033(5), 1171\u20131200 (2004)","journal-title":"SIAM J. Comput."}],"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\/978-3-642-38536-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:24:17Z","timestamp":1557764657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}