Dense subsets of pseudorandom sets

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 76-85

  Reingold, Orner ^a   Trevisan, Luca ^b   Tulsiani, Madhur ^b   Vadhan, Salil ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSURE PROPERTIES; DENSE SUBSETS; ENERGY INCREMENTS; ENTIRE DOMAINS; EXPONENTIAL COMPLEXITIES; INDISTINGUISHABILITY; ITERATIVE PARTITIONING; POLYNOMIAL COMPLEXITIES; PSEUDO RANDOMNESSES; PSEUDO RANDOMS; PSEUDOENTROPY; REGULARITY LEMMATA; SPI-RIT;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; PROBABILITY;

PROBABILITY DISTRIBUTIONS;

EID: 57949114014     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.38     Document Type: Conference Paper

References (12)

1. B. Barak, R. Shaltiel, and A. Wigderson. Computational analogues of entropy. In Proceedings of RANDOM'03, pages 200-215, 2003.
2. T. Gowers. Decompositions, approximate structure, transference, and the Hahn-Banach theorem. Preprint, 2008.
3. B. Green and T. Tao. The primes contain arbitrarily long arithmetic progressions. To appear in Annals of Mathematics. math.NT/0404188, 2004.
4. J. Hâstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4): 1364-1396, 1999.
5. T. Holenstein. Key agreement from weak bit agreement. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 664-673, New York, NY, USA, 2005. ACM.
6. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In 36th Annual Symposium on Foundations of Computer Science, pages 538-545, Milwaukee, Wisconsin, 23-25 Oct. 1995. IEEE.
7. R. Impagliazzo. Personal Communication, November 2008.
8. Y. Kohayakawa and V. Rödl. Szemerédi's regularity lemma and quasi-randomness. In Recent advances in algorithms and combinatorics. Springer, Berlin, 2002.
9. O. Reingold, L. Trevisan, M. Tulsiani, and S. Vadhan. Dense subsets of pseudorandom sets. Technical Report TR08-045, Electronic Colloquium, on Computational Complexity, 2008.
10. O. Reingold, L. Trevisan, M. Tulsiani, and S. Vadhan. New proofs of the Green-Tao-Ziegler dense model theorem: An exposition. arXivimath/0806081, 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 and T. Ziegler. The primes contain arbitrarily long polynomial progressions. arXiv:math/0610050, 2006.