ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR12-018 | 24th February 2012 19:19

Some definitorial suggestions for parameterized proof complexity

RSS-Feed




TR12-018
Authors: Joerg Flum, Moritz Müller
Publication: 2nd March 2012 08:46
Downloads: 1075
Keywords: 


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.



ISSN 1433-8092 | Imprint