One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Hausdorff dimension and oracle constructions
Theoretical Computer Science
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.89 |