Derandomizing Arthur-Merlin games under uniform assumptions

Computational Complexity

Volumn 10, Issue 3, 2001, Pages 247-259

  Lu, Chi Jen ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Arthur Merlin games; Derandomization; Graph nonisomorphism problem; Nondeterminism; Uniformity

Indexed keywords

EID: 0035739774     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-001-8196-9     Document Type: Article

References (21)

1. A. E. ANDREEV, A. E. F. CLEMENTI & J. D. P. ROLIM (1996). Hitting sets derandomize BPP. In Proc. 23rd International Colloquium on Automata, Languages, and Programming, 357-368.
2. L. BABAI, L. FORTNOW, N. NISAN & A. WIGDERSON (1993). BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complexity 3, 307-318.
3. M. BLUM & S. MICALI (1984). How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850-864.
4. H. BUHRMAN & L. FORTNOW (1999). One-sided versus two-sided randomness. In Proc. 16th Symposium on Theoretical Aspects of Computer Science, 100-109.
5. J. HOPCROFT, W. PAUL & L. VALIANT (1977). On time versus space. J. Assoc. Comput. Mach. 24, 332-337.
6. R. IMPAGLIAZZO, R. SHALTIEL & A. WIGDERSON (1999). Near optimal conversion of hardness into pseudo-randomness. In Proc. 40th Annual IEEE Symposium on the Foundations of Computer Science, 181-190.
7. R. IMPAGLIAZZO, R. SHALTIEL & A. WIGDERSON (2000). Extractors and pseudorandom generators with optimal seed length. In Proc. 32nd Annual ACM Symposium on Theory of Computing, 1-10.
8. R. IMPAGLIAZZO & A. WIGDERSON (1997). P=BPP if E requires exponential circuits: derandomizing the XOR lemma. In Proc. 29th Annual ACM Symposium on Theory of Computing, 220-229.
9. R. IMPAGLIAZZO & A. WIGDERSON (1998). Randomness vs. time: de-randomization under a uniform assumption. In Proc. 39th Annual IEEE Symposium on the Foundations of Computer Science, 734-743.
10. V. KABANETS (2000). Easiness assumptions and hardness tests: trading time for zero error. In Proc. 15th Annual IEEE Conference on Computational Complexity, 150-157.
11. R. M. KARP & R. LIPTON (1982). Turing machines that take advice. Enseign. Math. 28, 191-209.
12. A. KLIVANS & D. VAN MELKEBEEK (1999). Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In Proc. 31st Annual ACM Symposium on Theory of Computing, 659-667.
13. P. B. MILTERSEN & N. V. VINODCHANDRAN (1999). Derandomizing Arthur-Merlin games using hitting sets. In Proc. 40th Annual IEEE Symposium on the Foundations of Computer Science, 71-80.
14. N. NISAN & A. WIGDERSON (1994). Hardness vs. randomness. J. Comput. System Sci. 49, 149-167.
15. C. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley.
16. M. SAKS, A. SRINIVASAN & S. ZHOU (1998). Explicit OR-dispersers with polylogarithmic degree. J. Assoc. Comput. Mach. 41, 123-154.
17. M. SIPSER (1988). Expanders, randomness, or time vs. space. J. Comput. System Sci. 36, 379-383.
18. M. SUDAN, L. TREVISAN & S. VADHAN (2001). Pseudorandom generators without the XOR lemma. J. Comput. System Sci. 62, 236-266.
19. S. TODA (1991). PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20, 865-877.
20. L. TREVISAN (1999). Construction of near-optimal extractors using pseudo-random generators. In Proc. 31st Annual ACM Symposium on Theory of Computing, 141-148.
21. A. YAO (1982). Theory and applications of trapdoor functions. In Proc. 23rd Annual IEEE Symposium on the Foundations of Computer Science, 80-91.