Dense model theorems and their applications

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

Volumn 6597 LNCS, Issue , 2011, Pages 55-57

  Trevisan, Luca ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

ARITHMETIC PROGRESSIONS; PRIME NUMBER;

CRYPTOGRAPHY;

EID: 79953166402     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19571-6_4     Document Type: Conference Paper

References (14)

1. Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 200-215. Springer, Heidelberg (2003)
2. Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 293-302 (2008)
3. Gowers, T.: Decompositions, approximate structure, transference, and the Hahn-Banach theorem, arXiv:0811.3103 (2008)
4. n, arXiv:1002.2208 (2010)
5. n, arXiv:1002.2209 (2010)
6. Green, B., Tao, T.: The primes contain arbitrarily long arithmetic progressions. Annals of Mathematics 167, 481-547 (2008)
7. Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp. 538-545 (1995)
8. Impagliazzo, R.: Personal Communication (2008)
9. Mironov, I., Pandey, O., Reingold, O., Vadhan, S.P.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126-142. Springer, Heidelberg (2009)
10. Reingold, O., Trevisan, L., Tulsiani, M., Vadhan, S.: Dense subsets of pseudorandom sets. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 76-85 (2008)
11. Szemerédi, E.: On sets of integers containing no four elements in arithmetic progression. Acta Math. Acad. Sci. Hung. 20, 89-104 (1969)
12. Szemerédi, E.: On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica 27, 199-245 (1975)
13. Tao, T., Ziegler, T.: The primes contain arbitrarily long polynomial progressions. Acta Mathematica 201, 213-305 (2008)
14. Trevisan, L., Tulsiani, M., Vadhan, S.: Regularity, boosting, and efficiently simulating every high-entropy distribution. In: Proceedings of the 24th IEEE Conference on Computational Complexity (2009)