Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
The random oracle hypothesis is false
Journal of Computer and System Sciences
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
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)
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Other complexity classes and measures
Algorithms and theory of computation handbook
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.89 |