Beyersdorff, O, Koebler, J and Mueller, S (2009) Nondeterministic Instance Complexity and Proof Systems with Advice. In: Dediu, AH, Ionescu, AM and Martin-Vide, C, (eds.) Language and Automata Theory and Applications. Third International Conference, LATA 2009, 2-8 April 2009, Tarragona, Spain. Lecture Notes in Computer Science, 5457 . Springer Verlag , 164 - 175 . ISBN 978-3-642-00981-5Full text available as:
Available under License : See the attached licence file.
Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Krajíček  have recently introduced the notion of propositional proof systems with advice. In this paper we investigate the following question: Given a language L , do there exist polynomially bounded proof systems with advice for L ? Depending on the complexity of the underlying language L and the amount and type of the advice used by the proof system, we obtain different characterizations for this problem. In particular, we show that the above question is tightly linked with the question whether L has small nondeterministic instance complexity.
|Item Type:||Proceedings Paper|
|Copyright, Publisher and Additional Information:||© 2009, Springer Verlag. This is an author produced version of a paper published in Language and Automata Theory and Applications. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science|
|Depositing User:||Symplectic Publications|
|Date Deposited:||10 Dec 2012 10:48|
|Last Modified:||08 Feb 2013 17:41|
Actions (login required)