On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of 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
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Optimal proof systems imply complete sets for promise classes
Information and Computation
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
A note on quadratic residuosity and UP
Information Processing Letters
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Reductions between disjoint NP-pairs
Information and Computation
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
SIGACT news complexity theory column 52
ACM SIGACT News
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
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
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Reductions between disjoint NP-Pairs
Information and Computation
A note on quadratic residuosity and UP
Information Processing Letters
The computational complexity of game trees by eigen-distribution
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
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
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
| Hi-index | 0.00 |