Regularity, boosting, and efficiently simulating every high-entropy distribution

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 126-136

  Trevisan, Luca ^a   Tulsiani, Madhur ^a   Vadhan, Salil ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED FUNCTION; COMBINATORICS; COMPLEXITY THEORY; DISTINGUISHERS; ENTROPY DISTRIBUTION; FINITE DOMAINS; MIN-ENTROPY; POLYNOMIAL SIZE; QUANTITATIVE PARAMETERS; REGULARITY LEMMA;

LINEARIZATION; POLYNOMIALS; SIMULATORS; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 70350646988     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2009.41     Document Type: Conference Paper

References (15)

1. A. M. Frieze and R. Kannan. Quick Approximation to Matrices and Applications. Combinatorica, 19(2): 175-220, 1999.
2. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR Lemma. Technical Report TR95-50, Electronic Colloquium on Computational Complexity, 1995.
3. S. Goldwasser, S. Micali, and C. Rackof. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1): 186-208, 1989. Preliminary version in Proc of STOC'85.
4. T. Gowers. Decompositions, Approximate Structure, Transference, and the Hahn-Banach Theorem. arXiv: 0811.3103, 2008.
5. B. Green and T. Tao. The primes contain arbitrarily long arithmetic progressions. Annals of Mathematics, 167: 481-547, 2008.
6. T. Holenstein. Key agreement from weak bit agreement. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 664-673, 2005.
7. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pages 538-545, 1995.
8. R. Impagliazzo. Personal Communication, 2008.
9. A. R. Klivans and R. A. Servedio. Boosting and Hard-Core Set Construction. Machine Learning, 51(3): 217-238, 2003.
10. O. Reingold, L. Trevisan, M. Tulsiani, and S. Vadhan. Dense Subsets of Pseudorandom Sets. In Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pages 76-85, 2008.
11. E. Szemerédi. On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica, 27: 199-245, 1975.
12. T. Tao. Structure and randomness in combinatorics. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, pages 3-18, 2007.
13. T. Tao and T. Ziegler. The Primes Contain Arbitrarily Long Polynomial Progressions. Acta Mathematica, 201: 213305, 2008.
14. L. Trevisan and S. P. Vadhan. Extracting Randomness from Samplable Distributions. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 32-42, 2000.
15. A. C. Yao. Theory and Applications of Trapdoor Functions. In Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.