{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:48:37Z","timestamp":1725889717744},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_9","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T06:50:58Z","timestamp":1346223058000},"page":"73-84","source":"Crossref","is-referenced-by-count":0,"title":["Some Definitorial Suggestions for Parameterized Proof Complexity"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Flum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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. LNCS, vol.\u00a06755, pp. 630\u2013641. Springer, Heidelberg (2011)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02391554","volume":"34","author":"S. Buss","year":"1995","unstructured":"Buss, S.: Some remarks on the lengths of propositional proofs. Archive for Mathematical Logic\u00a034, 377\u2013394 (1995)","journal-title":"Archive for Mathematical Logic"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"916","DOI":"10.2307\/2273826","volume":"52","author":"S. Buss","year":"1987","unstructured":"Buss, S.: Polynomial size proofs of the propositional pigeon principle. Journal of Symbolic Logic\u00a052, 916\u2013927 (1987)","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511676277"},{"key":"9_CR5","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. The Journal of Symbolic Logic\u00a044, 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00037-010-0001-1","volume":"20","author":"S.S. Dantchev","year":"2011","unstructured":"Dantchev, S.S., Martin, B., Szeider, S.: Parameterized proof complexity. Computational Complexity\u00a020(1), 51\u201385 (2011)","journal-title":"Computational Complexity"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"9_CR8","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. Journal of Computer and System Sciences\u00a077(1), 91\u2013106 (2011)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0168-0072(89)90012-2","volume":"41","author":"J. Kraj\u00ed\u010dek","year":"1989","unstructured":"Kraj\u00ed\u010dek, J.: On the number of steps in proofs. Annals of Pure and Applied Logic\u00a041, 153\u2013178 (1989)","journal-title":"Annals of Pure and Applied Logic"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u010dek, J.: Bounded arithmetic, propositional logic, and complexity theory. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511529948"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.2307\/2274765","volume":"54","author":"J. Kraj\u00ed\u010dek","year":"1989","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic\u00a054, 1063\u20131088 (1989)","journal-title":"The Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:03:32Z","timestamp":1620115412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}