Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
Hi-index | 0.00 |