Using nondeterminism to amplify hardness

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 192-201

  Healy, Alexander ^a   Vadhan, Salil ^a   Viola, Emanuele ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Average case complexity; Hardness amplification; Noise stability; Pseudorandom generators for space bounded computation

Indexed keywords

AMPLIFICATION; FUNCTION EVALUATION; HARDNESS; NETWORKS (CIRCUITS); POLYNOMIALS; STABILITY;

AVERAGE-CASE COMPLEXITY; HARDNESS AMPLIFICATION; NOISE STABILITY; PSEUDORANDOM GENERATORS FOR SPACE-BOUNDED COMPUTATION;

ACOUSTIC NOISE;

EID: 4544286907     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007389     Document Type: Conference Paper

References (27)

1. Ian Anderson. Combinatorics of finite sets. Dover Publications Inc., Mineola. NY, 2002. Corrected reprint of the 1989 edition.
2. László Babai, Lance Fortnow, and Carsten Lund. Nondeterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
3. Donald Beaver and Joan Feigenbaum. Hiding instances in multioracle queries. In 7th Annual Symposium on Theoretical Aspects of Computer Science, volume 415 of Lecture Notes in Computer Science, pages 37-48, Rouen, France. 22-24 February 1990. Springer.
4. Michael Ben-Or and Nathan Linial. Collective coin-flipping. In Silvio Micali, editor, Randomness and Computation, pages 91-115. Academic Press, New York, 1990.
5. Andrej Bogdanov and Luca Trevisan. On worst-case to average-case reductions for NP problems. In Proceedings of 44th FOCS, Cambridge, Massachusetts, 11-14 October 2003.
6. Jin-Yi Cai, A. Pavan, and D. Sivakumar. On the hardness of the permanent. In 16th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Trier, Germany, March 4-6 1999. Springer-Verlag.
7. Uriel Feige and Garsten Lund. On the hardness of computing the permanent of random matrices. Computational Complexity, 6(2):101-132, 1996.
8. Joan Feigenbaum and Lance Fortnow. Random-self-reducibility of complete sets. SIAM J. on Computing, 22(5):994-1005, October 1993.
9. Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In Proceedings of 21st STOC, pages 25-32, Seattle, Washington, 15-17 May 1989.
10. Oded Goldreich, Noam Nisan, and Avi Wigderson. On Yao's XOR lemma. Technical Report TR95-050, Electronic Colloquium on Computational Complexity, March 1995. http://www.eccc.uni-trier.de/eccc.
11. Russell Impagliazzo. Hard-core distributions for somewhat hard, problems. In Proceedings of 36th FOCS, pages 538-545, Milwaukee, Wisconsin, 23-25 October 1995. IEEE.
12. Russell Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In Proceedings of 26th STOC, pages 356-364, Montréal, Québec, Canada, 23-25 May 1994.
13. Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of 29th STOC, pages 220-229, El Paso, Texas, 4-6 May 1997.
14. Russell Impagliazzo and Avi Wigderson. Randomness vs. time: De-randomization under a uniform assumption. In Proceedings of 36th FOCS, Palo Alto, CA, November 8-11 1998. IEEE.
15. Jeff Kahn, Gil Kalai, and Nathan Linial. The influence of variables on Boolean functions (extended abstract). In Proceedings of 29th FOCS, pages 68-80, White Plains, New York, 24-26 October 1988. IEEE.
16. Adam Klivans and Rocco A. Servedio. Boosting and hard-core sets. Machine Learning, 53(3):217-238, 2003.
17. Richard Lipton. New directions in testing. In Proceedings of DIM ACS Workshop on Distributed Computing and Cryptography, 1989.
18. E. Mossel and R. O'Donnell. On the noise sensitivity of monotone functions. Random Structures & Algorithms.
19. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12, 1992.
20. Noam Nisan. Pseudorandom bits for constant depth circuits. Combinatorica, 11(1):63-70, 1991.
21. Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, October 1994.
22. Ryan O'Donnell. Hardness amplification within NP. In Proceedings of 34th STOC, pages 751-760. ACM, May 2002.
23. Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. J. Comput. System Sci., 62(2):236-266, 2001. Special issue on the Fourteenth Annual IEEE Conference on Computational Complexity (Atlanta, GA, 1999).
24. Luca Trevisan. List decoding using the XOR lemma. In Proceedings of 44th FOCS, Cambridge, Massachusetts, 11-14 October 2003.
25. Luca Trevisan and Salil Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, pages 129-138, Montréal, CA, May 2002. IEEE.
26. Emanuele Viola. The complexity of constructing pseudorandom generators from hard functions, Technical report, Electronic Colloquium on Computational Complexity, 2004. http://www.eccc.uni-trier.de/eccc. Preliminary version titled 'Hardness vs. Randomness within Alternating Time', in Eighteenth Annual IEEE Conference on Computational Complexity.
27. Andrew C. Yao. Theory and applications of trapdoor functions (extended abstract). In Proceedings of 23rd FOCS, pages 80-91, Chicago, Illinois, 3-5 November 1982. IEEE.