Gap-definable counting classes
Journal of Computer and System Sciences
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Information and Computation
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Information and Computation
| Hi-index | 0.02 |