S2p ⊆ ZPPNP

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 620-628

  Cai, J Y ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; SAMPLING; SET THEORY; THEOREM PROVING;

POLYNOMIAL SIZE CIRCUITS;

COMPUTER SCIENCE;

EID: 0035175950     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. On pseudorandomness and resource-bounded measure
2. NP and other lowness results
3. Trading group theory for randomness
4. If NP has polynomial size circuits then MA=AM
5. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
6. Oracles and queries that are sufficient for exact learning
7. Uniform Generation of NP-witnesses using an NP-oracle
8. On BPP and the polynomial-time hierarchy
9. The knowledge complexity of interactive proofs
10. Private coins versus public coins in interactive proof systems
11. On relativized exponential and probabilistic complexity classes
12. Recent directions in algorithmic research
13. Random generation of combinatorial structures from a uniform distribution
14. Some connections between nonuniform and uniform complexity classes
15. New collapse consequences of NP having small circuits ICALP
16. Journal version New Collapse Consequences of NP Having Small Circuits
17. BPP and the polynomial hierarchy
18. A note on sparse oracles for NP
19. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
20. Sparse hard sets for counting classes
21. On polynomial time bounded truth-table reducibility of NP sets to sparse sets
22. Symmetric alternation captures BPP
23. A complexity theoretic approach to randomness
24. The polynomial-time hierarchy
25. The complexity of approximate counting (Preliminary Version)
26. On approximation algorithms for #P
27. Relativized circuit complexity
28. Probabilistic quantifiers vs Distrustful adversaries
29. Simulating BPP using a general weak random source