Some definitorial suggestions for parameterized proof complexity

Authors:
Jörg Flum;Moritz Müller
Affiliations:
Universität Freiburg, Germany;Kurt Gödel Research Center, Universität Wien, Austria
Venue:
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Year:
2012

Citing 7
Cited 0

Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Logical Foundations of Proof Complexity

Logical Foundations of Proof Complexity
Infeasibility of instance compression and succinct PCPs for NP

Journal of Computer and System Sciences
Parameterized Proof Complexity

Computational Complexity
Parameterized bounded-depth Frege is not optimal

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

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.