Journal of the ACM (JACM)
Resource-Bounded Kolmogorov Complexity Revisited
SIAM Journal on Computing
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Does Advice Help to Prove Propositional Tautologies?
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Proof systems that take advice
Information and Computation
Optimal acceptors and optimal proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Krají***ek [1] 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.