Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Hi-index | 0.00 |