Quantitative relativizations of complexity classes
SIAM Journal on Computing
Relativized Arthur-Merlin versus Merlin-Arthur games
Information and Computation
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Journal of the ACM (JACM)
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Designing programs that check their work
Journal of the ACM (JACM)
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
Average-Case Intractability vs. Worst-Case Intractability
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the structure of low sets [complexity classes]
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We show the following new lowness results for the probabilistic class ZPPNP. - The class AM ∩ coAM is low for ZPPNP. As a consequence it follows that Graph Isomorphism and several group-theoretic problems known to be in AM ∩ coAM are low for ZPPNP. - The class IP[P=poly], consisting of sets that have interactive proof systems with honest provers in P=poly, is also low for ZPPNP. We consider lowness properties of nonuniform function classes, namely, NPMV/poly, NPSV/poly, NPMVt/poly, and NPSVt/poly. Specifically, we show that - Sets whose characteristic functions are in NPSV/poly and that have program checkers (in the sense of Blum and Kannan [8]) are low for AM and ZPPNP. - Sets whose characteristic functions are in NPMVt/poly are low for Σ2p.