{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:49:00Z","timestamp":1773143340106,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132519","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Gowers uniformity, influence of variables, and PCPs"],"prefix":"10.1145","author":[{"given":"Alex","family":"Samorodnitsky","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[{"name":"U.C. Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1747"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_4_1","first-page":"637","volume-title":"Proceedings of the International Congress of Mathematicians","volume":"3","author":"Arora Sanjeev","year":"2002","unstructured":"Sanjeev Arora . How NP got a new definition: a survey of probabilistically checkable proofs . In Proceedings of the International Congress of Mathematicians , pages 637 -- 648 , 2002 . Volume 3 . Sanjeev Arora. How NP got a new definition: a survey of probabilistically checkable proofs. In Proceedings of the International Congress of Mathematicians, pages 637--648, 2002. Volume 3."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556674"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"e_1_3_2_1_11_1","first-page":"194","volume-title":"More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP","author":"Engebretsen Lars","year":"2005","unstructured":"Lars Engebretsen and Jonas Holmerin . More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP . pages 194 -- 205 , 2005 . Lars Engebretsen and Jonas Holmerin. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. pages 194--205, 2005."},{"key":"e_1_3_2_1_12_1","first-page":"649","volume-title":"Proceedings of the International Congress of Mathematicians","volume":"3","author":"Feige Uriel","year":"2002","unstructured":"Uriel Feige . Approximation thresholds for combinatorial optimization problems . In Proceedings of the International Congress of Mathematicians , pages 649 -- 658 , 2002 . Volume 3 . Uriel Feige. Approximation thresholds for combinatorial optimization problems. In Proceedings of the International Congress of Mathematicians, pages 649--658, 2002. Volume 3."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000390050065"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-001-0332-9"},{"key":"e_1_3_2_1_15_1","volume-title":"The primes contain arbitrarily long arithmetic progressions. To appear in Annals of Mathematics. math.NT\/0404188","author":"Green Ben","year":"2004","unstructured":"Ben Green and Terence Tao . The primes contain arbitrarily long arithmetic progressions. To appear in Annals of Mathematics. math.NT\/0404188 , 2004 . Ben Green and Terence Tao. The primes contain arbitrarily long arithmetic progressions. To appear in Annals of Mathematics. math.NT\/0404188, 2004."},{"key":"e_1_3_2_1_16_1","volume-title":"An inverse theorem for the Gowers U3 norm. math.NT\/0503014","author":"Green Ben","year":"2005","unstructured":"Ben Green and Terence Tao . An inverse theorem for the Gowers U3 norm. math.NT\/0503014 , 2005 . Ben Green and Terence Tao. An inverse theorem for the Gowers U3 norm. math.NT\/0503014, 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_19_1","first-page":"956","volume-title":"Approximating Max kCSP - outperforming a random assignment with almost a linear factor","author":"Hast Gustav","year":"2005","unstructured":"Gustav Hast . Approximating Max kCSP - outperforming a random assignment with almost a linear factor . pages 956 -- 968 , 2005 . Gustav Hast. Approximating Max kCSP - outperforming a random assignment with almost a linear factor. pages 956--968, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.161.397"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10068"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.64"},{"key":"e_1_3_2_1_23_1","first-page":"68","volume-title":"Proceedings of the 29th IEEE Symposium on Foundations of Computer Science","author":"Kahn J.","year":"1988","unstructured":"J. Kahn , G. Kalai , and N. Linial The influence of variables on boolean functions . In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science , pp. 68 -- 80 , 1988 . J. Kahn, G. Kalai, and N. Linial The influence of variables on boolean functions. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pp. 68--80, 1988."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.49"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214437"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.65"},{"key":"e_1_3_2_1_28_1","unstructured":"Bryna Kra. The Green-Tao theorem on arithmetic progressions in the primes: an ergodic point of view. Bulletin of the AMS. To appear.  Bryna Kra. The Green-Tao theorem on arithmetic progressions in the primes: an ergodic point of view. Bulletin of the AMS. To appear."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.74"},{"key":"e_1_3_2_1_30_1","volume-title":"Manuscript","author":"Samorodnitsky Alex","year":"2005","unstructured":"Alex Samorodnitsky . Hypergraph linearity and quadraticity tests for boolean functions . Manuscript , 2005 . Alex Samorodnitsky. Hypergraph linearity and quadraticity tests for boolean functions. Manuscript, 2005."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009209"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380839"},{"key":"e_1_3_2_1_35_1","volume-title":"Approximation Algorithms","author":"Vazirani Vijay","year":"2001","unstructured":"Vijay Vazirani . Approximation Algorithms . Springer , 2001 . Vijay Vazirani. Approximation Algorithms. Springer, 2001."}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:50Z","timestamp":1750263530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":34,"alternative-id":["10.1145\/1132516.1132519","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132519","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}