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
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
On optimal algorithms and optimal proof systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On slicewise monotone parameterized problems and optimal proof systems for TAUT
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
Hard instances of algorithms and proof systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Hi-index | 0.00 |