Derandomizing arthur-merlin games under uniform assumptions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1969, Issue , 2000, Pages 302-312

  Lu, Chi Jen ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARTHUR-MERLIN GAMES; COMPLEXITY CLASS; DERANDOMIZATION; DERANDOMIZING; ISOMORPHISM PROBLEMS; NON-DETERMINISM; NONDETERMINISTIC POLYNOMIAL; SUBEXPONENTIAL TIME;

POLYNOMIAL APPROXIMATION;

EID: 84949780238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_26     Document Type: Conference Paper

References (21)

1. A.E. Andreev, A.E.F. Clement, and J.D.P. Rolim, Hitting sets derandomize BPP, Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming, pages 357-368, 1996.
2. H. Buhrman, L. Fortnow, One-sided versus two-sided randomness, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, pages 100-109, 1999.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Computational Complexity, 3(4), pp 307-318, 1993.
4. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-rnadom bits, SIAM Journal on Computing, 13, pages 850-864, 1984.
5. N. Nisan and A. Wigderson, Hardness vs. randomness, Journal of Computer and System Sciences, 49, pages 149-167, 1994.
6. J. Hopcroft, W. Paul, and L. Valiant, On time versus space, Journal of ACM, 24, pages 332-337, 1977.
7. R. Impagliazzo, R. Shaltiel, and A. Wigderson, Near optimal conversion of hardness into pseudo-randomness, Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, pages 181-190, 1999.
8. R. Impagliazzo, R. Shaltiel, and A. Wigderson, Extractors and pseudo-random generators with optimal seed length, Proceedings of the 32th Annual ACM Sympo-sium on Theory of Computing, pages 1-10, 2000.
9. R. Impagliazzo and A. Wigderson, P=BPP if E requires exponential circuits: der-andomizing the XOR lemma, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
10. R. Impagliazzo and A. Wigderson, Randomness vs. time: de-randomization under a uniform assumption, Proceedings of the 39th Annual IEEE Symposium on the Foundations of Computer Science, pages 734-743, 1998.
11. V. Kabanets, Easiness assumptions and hardness tests: trading time for zero error, In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000.
12. R.M. Karp and R. Lipton, Turing machines that take advices, L'Ensignment Ma-thematique, 28, pages 191-209, 1982.
13. A. Klivans and D. van Melkebeek, Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses, Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pages 659-667, 1999.
14. P. B. Miltersen and N.V. Vinodchandran, Derandomizing Arthur-Merlin games using hitting sets, Proceedings of the 40th Annual IEEE Symposium on the Foun-dations of Computer Science, 1999.
15. C. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
16. M. Saks, A. Srinivasan, and S. Zhou, Explicit OR-dispersers with polylogarithmic degree, Journal of ACM, 41(1), pages 123-154, 1998.
17. M. Sipser, Expanders, randomness, or time vs. space, Journal of Computer and System Sciences, 36, pages 379-383, 1988.
18. M. Sudan, L. Trevisan, and S. Vadhan, Pseudorandom generators without the XOR lemma, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 537-546, 1999.
19. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM Journal on Com-puting, 20(5), pages 865-877, 1991.
20. L. Trevisan, Construction of near-optimal extractors using pseudo-random gene-rators, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 141-148, 1999.
21. A. Yao, Theory and applications of trapdoor functions, Proceedings of the 23rd Annual IEEE Symposium on the Foundations of Computer Science, pages 80-91, 1982.