On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Other complexity classes and measures
Algorithms and theory of computation handbook
On complete problems, relativizations and logics for complexity classes
Fields of logic and computation
Hi-index | 0.00 |