Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
Propositional proof complexity: past, present, and future
Current trends in theoretical computer science
Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Learnability and Automatizability
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
| Hi-index | 0.00 |
The underlying question of propositional proof complexity is amazingly simple: when interesting propositional tautologies possess efficient (which usually means short) proofs in a given propositional proof system? This theory is extremely well connected to very different disciplines like computational complexity, theoretical cryptography, automated theorem proving, mathematical logic, algebra and geometry. And, given its mixed origins, methods and concepts employed in the area are also very diverse.