{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T10:10:02Z","timestamp":1746267002331,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_79","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"955-966","source":"Crossref","is-referenced-by-count":0,"title":["Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[]},{"given":"Noga","family":"Ron-Zewi","sequence":"additional","affiliation":[]},{"given":"Madhur","family":"Tulsiani","sequence":"additional","affiliation":[]},{"given":"Julia","family":"Wolf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"79_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Lovett, S., Ron-Zewi, N.: An additive combinatorics approach relating rank to communication complexity. In: FOCS, pp. 177\u2013186. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.39"},{"key":"79_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Zewi, N.: From affine to two-source extractors via approximate duality. In: Fortnow, L., Vadhan, S.P. (eds.) STOC, pp. 177\u2013186. ACM (2011)","DOI":"10.1145\/1993636.1993661"},{"key":"79_CR3","unstructured":"Bhowmick, A., Dvir, Z., Lovett, S.: Lower bounds on vector matching codes. In: STOC. ACM (2013)"},{"issue":"1","key":"79_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/blms\/bdp074","volume":"42","author":"P. Candela","year":"2010","unstructured":"Candela, P.: On the structure of steps of three-term arithmetic progressions in a dense set of integers. Bull. Lond. Math. Soc.\u00a042(1), 1\u201314 (2010)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"3","key":"79_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1215\/S0012-7094-02-11331-3","volume":"113","author":"M.-C. Chang","year":"2002","unstructured":"Chang, M.-C.: A polynomial bound in Freiman\u2019s theorem. Duke Math. J.\u00a0113(3), 399\u2013419 (2002)","journal-title":"Duke Math. J."},{"key":"79_CR6","unstructured":"Croot, E., \u0141aba, I., Sisask, O.: Arithmetic progressions in sumsets and Lp-almost-periodicity (March 2011), http:\/\/arxiv.org\/abs\/1103.6000v1"},{"issue":"6","key":"79_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1007\/s00039-010-0101-8","volume":"20","author":"E. Croot","year":"2010","unstructured":"Croot, E., Sisask, O.: A probabilistic technique for finding almost-periods of convolutions. Geom. Funct. Anal.\u00a020(6), 1367\u20131396 (2010)","journal-title":"Geom. Funct. Anal."},{"key":"79_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"79_CR9","doi-asserted-by":"crossref","unstructured":"Gopalan, P.: A fourier-analytic approach to reed-muller decoding. In: FOCS, pp. 685\u2013694. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.71"},{"key":"79_CR10","doi-asserted-by":"crossref","unstructured":"Gopalan, P., Klivans, A.R., Zuckerman, D.: List-decoding reed-muller codes over small fields. In: Dwork, C. (ed.) STOC, pp. 265\u2013274. ACM (2008)","DOI":"10.1145\/1374376.1374417"},{"key":"79_CR11","unstructured":"Gowers, T., Wolf, J.: Linear forms and quadratic uniformity for functions on \u2124 N . J. Anal. Math., arXiv:1002.2210 (2010) (to appear)"},{"key":"79_CR12","doi-asserted-by":"crossref","unstructured":"Gowers, T., Wolf, J.: The true complexity of a system of linear equations. Proc. Lond. Math. Soc. (3),100(1), 155\u2013176 (2010)","DOI":"10.1112\/plms\/pdp019"},{"issue":"2","key":"79_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1112\/S0025579311001264","volume":"57","author":"T. Gowers","year":"2012","unstructured":"Gowers, T., Wolf, J.: Linear forms and quadratic uniformity for functions on $\\mathbb{F}_p^n$ . Mathematika\u00a057(2), 215\u2013237 (2012)","journal-title":"Mathematika"},{"key":"79_CR14","series-title":"London Math. Soc. Lecture Note Ser","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/CBO9780511734885.002","volume-title":"Surveys in Combinatorics 2005","author":"B. Green","year":"2005","unstructured":"Green, B.: Finite field models in additive combinatorics. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Ser, vol.\u00a0327, pp. 1\u201327. Cambridge Univ. Press, Cambridge (2005)"},{"key":"79_CR15","series-title":"CRM Proc. Lecture Notes","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/crmp\/043\/06","volume-title":"Additive Combinatorics","author":"B. Green","year":"2007","unstructured":"Green, B.: Montr\u00e9al notes on quadratic Fourier analysis. In: Additive Combinatorics. CRM Proc. Lecture Notes, vol.\u00a043, pp. 69\u2013102. Amer. Math. Soc., Providence (2007)"},{"issue":"1","key":"79_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1017\/S0013091505000325","volume":"51","author":"B. Green","year":"2008","unstructured":"Green, B., Tao, T.: An inverse theorem for the Gowers U 3(G) norm. Proc. Edinb. Math. Soc (2), 51(1), 73\u2013153 (2008)","journal-title":"Proc. Edinb. Math. Soc. (2)"},{"key":"79_CR17","doi-asserted-by":"crossref","unstructured":"Hatami, H., Lovett, S.: Higher-order Fourier analysis of $\\mathbb{F}_p^n$ and the complexity of systems of linear forms. Geom. Func. Anal (2011) (to appear)","DOI":"10.1007\/s00039-011-0141-8"},{"key":"79_CR18","unstructured":"Impagliazzo, R., Moore, C., Russell, A.: An Entropic Proof of Chang\u2019s Inequality (May 2012), http:\/\/arxiv.org\/abs\/1205.0263v1"},{"key":"79_CR19","first-page":"29","volume":"19","author":"S. Lovett","year":"2012","unstructured":"Lovett, S.: An exposition of Sanders\u2019s quasi-polynomial Freiman-Ruzsa theorem. Electronic Colloquium on Computational Complexity (ECCC)\u00a019, 29 (2012)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"79_CR20","unstructured":"Ruzsa, I.: An analog of Freiman\u2019s theorem in groups. Ast\u00e9risque xv(258), 323\u2013326 (1999); Structure theory of set addition"},{"key":"79_CR21","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A.: Low-degree tests at large distances. In: STOC, pp. 506\u2013515 (2007)","DOI":"10.1145\/1250790.1250864"},{"key":"79_CR22","unstructured":"Sanders, T.: On the Bogolyubov-Ruzsa lemma. Anal. PDE (2010) (to appear)"},{"issue":"1","key":"79_CR23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.4064\/aa146-1-6","volume":"146","author":"T. Sanders","year":"2011","unstructured":"Sanders, T.: Green\u2019s sumset problem at density one half. Acta Arith.\u00a0146(1), 91\u2013101 (2011)","journal-title":"Acta Arith."},{"key":"79_CR24","doi-asserted-by":"crossref","unstructured":"Sanders, T.: On Roth\u2019s theorem on progressions. Ann. of Math (2), 174(1), 619\u2013636 (2011)","DOI":"10.4007\/annals.2011.174.1.20"},{"key":"79_CR25","unstructured":"Sanders, T.: Lecture notes on applications of commutative harmonic analysis (July 2012), http:\/\/people.maths.ox.ac.uk\/~sanders"},{"key":"79_CR26","doi-asserted-by":"crossref","unstructured":"Tao, T., Vu, V.: Additive combinatorics. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511755149"},{"key":"79_CR27","doi-asserted-by":"crossref","unstructured":"Tulsiani, M., Wolf, J.: Quadratic Goldreich-Levin theorems. In: FOCS, pp. 619\u2013628 (2011)","DOI":"10.1109\/FOCS.2011.59"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:06Z","timestamp":1746264666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}