The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Journal of the ACM (JACM)
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
Information and Computation
Space Complexity in Propositional Calculus
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
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Optimal proof systems imply complete sets for promise classes
Information and Computation
Space complexity of random formulae in resolution
Random Structures & Algorithms
A combinatorial characterization of treelike resolution space
Information Processing Letters
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
Parameterized Proof Complexity
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth 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
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Nondeterministic Instance Complexity and Proof Systems with Advice
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
Optimal acceptors and optimal proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies This approach has been intensively studied since the late 70's and a lot of progress has been made During the last years research was started investigating alternative notions of proof systems There are interesting results stemming from dropping the uniformity requirement, allowing oracle access, using quantum computations, or employing probabilism These lead to different notions of proof systems for which we survey recent results in this paper.