Hardness amplification within NP

Journal of Computer and System Sciences

Volumn 69, Issue 1, 2004, Pages 68-94

  O'Donnell, Ryan ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Expected bias; Hardness amplification; Monotone; Noise sensitivity; NP; XOR Lemma

Indexed keywords

ACOUSTIC NOISE; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; HARDNESS; POLYNOMIALS; PROBABILITY; SENSITIVITY ANALYSIS;

EXPECTED BIAS; HARDNESS AMPLIFICATION; MONOTONE; NOISE SENSITIVITY; XOR LEMMA;

AMPLIFICATION;

EID: 2942702375     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.01.001     Document Type: Conference Paper

References (22)

1. S. Bezrukov, Isoperimetric problems in discrete spaces, in: P. Frankl, Z. Furedi, G. Katona, D. Miklós (Eds.), Extremal Problems for Finite Sets, János Mathematics Society Bolyai, Budapest, Vol. 3, 1994.
2. Babai L., Fortnow L., Nisan N., Wigderson A. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complexity. 3:1993;307-318.
3. Bshouty N., Jackson J., Tamon C. Uniform-distribution attribute noise learnability. Comput. Learning Theory. 12:1999;75-80.
4. Benjamini I., Kalai G., Schramm O. Noise sensitivity of boolean functions and applications to percolation. Inst. Hautes Études Sci. Publ. Math. 90:1999;5-43.
5. Ben-Or M., Linial N. Collective coin flipping. Micali S. Randomness and Computation. 1990;Academic Press, New York.
6. Bshouty N., Tamon C. On the Fourier spectrum of monotone functions. J. ACM. 43(4):1996;747-770.
7. Feller W. An Introduction to Probability Theory and its Applications. 1968;Wiley, New York.
8. O. Goldreich, N. Nisan, A. Wigderson, On Yao's XOR-Lemma, Electron. Colloq. Comput. Complexity 50 (1995).
9. M. Goldmann, A. Russell, Spectral bounds on general hard core predicates, Sympos. Theoret. Aspects Comput. Sci. (2000).
10. Impagliazzo R. Hard-core distributions for somewhat hard problems. Found. Comput. Sci. 36:1995;538-545.
11. R. Impagliazzo, A. Wigderson, P=BPP if E requires exponential circuits: Derandomizing the XOR lemma, Sympos. Theory Comput. (1997).
12. Kahn J., Kalai G., Linial N. The influence of variables on boolean functions. Found. Comput. Sci. 29:1988;58-80.
13. Klivans A., Servedio R. Boosting and hard-core sets. Found. Comput. Sci. 40:1999;624-633.
14. Linial N., Mansour Y., Nisan N. Constant depth circuits, Fourier transforms, and learnability. J. ACM. 40(3):1993;607-620.
15. log log n) learning algorithm for DNF under the uniform distribution J. Comput. System Sci. 50(3):1995.
16. E. Mossel, R. O'Donnell, On the noise sensitivity of monotone functions, Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Versailles, France, 2002.
17. Nisan N., Wigderson A. Hardness vs. randomness. J. Comput. System Sci. 49(2):1994.
18. V. Sazonov, Normal Approximation - Some Recent Advances, Lecture Notes in Mathematics, Vol. 879, Springer, Berlin, 1981.
19. R. Servedio, Efficient algorithms in computational learning theory, Ph.D. Thesis, Harvard University, 2001.
20. R. Shaltiel, Towards proving strong direct product theorems, Electron. Colloq. Comput. Complexity 9 (2001).
21. Sudan M., Trevisan L., Vadhan S. Pseudorandom generators without the XOR lemma. J. Comput. System Sci. 62(2):2001;236-266.
22. Yao A. Theory and application of trapdoor functions. Found. Comput. Sci. 23:1982;80-91.