On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
On the Structure of the Simulation Order of Proof Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Optimal Proof Systems and Sparse Sets
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Is the Standard Proof System for SAT P-Optimal?
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Optimal proof systems imply complete sets for promise classes
Information and Computation
Reduction of Hilbert-type proof systems to the if-then-else equational logic
Journal of Applied Mathematics and Computing
On optimal algorithms and optimal proof systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Survey of disjoint NP-pairs and relations to propositional proof systems
Theoretical Computer Science
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |