On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
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
Optimal proof systems imply complete sets for promise classes
Information and Computation
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
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
On optimal algorithms and optimal proof systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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 |