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, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
On optimal algorithms and optimal proof systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On an optimal randomized acceptor for graph nonisomorphism
Information Processing Letters
Optimal acceptors and optimal proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
| Hi-index | 0.00 |