Abstract
We introduce a (new) notion of parameterized proof system. For parameterized versions of standard proof systems such as Extended Frege and Substitution Frege we compare their complexity with respect to parameterized simulations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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. 6755, pp. 630–641. Springer, Heidelberg (2011)
Buss, S.: Some remarks on the lengths of propositional proofs. Archive for Mathematical Logic 34, 377–394 (1995)
Buss, S.: Polynomial size proofs of the propositional pigeon principle. Journal of Symbolic Logic 52, 916–927 (1987)
Cook, S., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press (2010)
Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic 44, 36–50 (1979)
Dantchev, S.S., Martin, B., Szeider, S.: Parameterized proof complexity. Computational Complexity 20(1), 51–85 (2011)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. Journal of Computer and System Sciences 77(1), 91–106 (2011)
Krajíček, J.: On the number of steps in proofs. Annals of Pure and Applied Logic 41, 153–178 (1989)
Krajíček, J.: Bounded arithmetic, propositional logic, and complexity theory. Cambridge University Press (1995)
Krajíček, J., Pudlák, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic 54, 1063–1088 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flum, J., Müller, M. (2012). Some Definitorial Suggestions for Parameterized Proof Complexity. In: Thilikos, D.M., Woeginger, G.J. (eds) Parameterized and Exact Computation. IPEC 2012. Lecture Notes in Computer Science, vol 7535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33293-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-33293-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33292-0
Online ISBN: 978-3-642-33293-7
eBook Packages: Computer ScienceComputer Science (R0)