{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:41:52Z","timestamp":1741153312081,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_4","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"55-57","source":"Crossref","is-referenced-by-count":1,"title":["Dense Model Theorems and Their Applications"],"prefix":"10.1007","author":[{"given":"Luca","family":"Trevisan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Barak","year":"2003","unstructured":"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.\u00a02764, pp. 200\u2013215. Springer, Heidelberg (2003)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"4_CR3","unstructured":"Gowers, T.: Decompositions, approximate structure, transference, and the Hahn-Banach theorem, arXiv:0811.3103 (2008)"},{"key":"4_CR4","unstructured":"Gowers, T., Wolf, J.: Linear forms and higher-degree uniformity for functions on $\\mathbb{F}_p^n$ , arXiv:1002.2208 (2010)"},{"key":"4_CR5","unstructured":"Gowers, T., Wolf, J.: Linear forms and quadratic uniformity for functions on $\\mathbb{F}_p^n$ , arXiv:1002.2209 (2010)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.4007\/annals.2008.167.481","volume":"167","author":"B. Green","year":"2008","unstructured":"Green, B., Tao, T.: The primes contain arbitrarily long arithmetic progressions. Annals of Mathematics\u00a0167, 481\u2013547 (2008)","journal-title":"Annals of Mathematics"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"key":"4_CR8","unstructured":"Impagliazzo, R.: Personal Communication (2008)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I. Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.P.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 126\u2013142. Springer, Heidelberg (2009)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"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\u201385 (2008)","DOI":"10.1109\/FOCS.2008.38"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01894569","volume":"20","author":"E. Szemer\u00e9di","year":"1969","unstructured":"Szemer\u00e9di, E.: On sets of integers containing no four elements in arithmetic progression. Acta Math. Acad. Sci. Hung.\u00a020, 89\u2013104 (1969)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E. Szemer\u00e9di","year":"1975","unstructured":"Szemer\u00e9di, E.: On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica\u00a027, 199\u2013245 (1975)","journal-title":"Acta Arithmetica"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11511-008-0032-5","volume":"201","author":"T. Tao","year":"2008","unstructured":"Tao, T., Ziegler, T.: The primes contain arbitrarily long polynomial progressions. Acta Mathematica\u00a0201, 213\u2013305 (2008)","journal-title":"Acta Mathematica"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/CCC.2009.41"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:56:53Z","timestamp":1741107413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}