{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:53Z","timestamp":1750694693883,"version":"3.41.0"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2009,2,28]],"date-time":"2009-02-28T00:00:00Z","timestamp":1235779200000},"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":["SIGACT News"],"published-print":{"date-parts":[[2009,2,28]]},"abstract":"<jats:p>This article is a unified treatment of the state-of-the-art on the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0 1 }. It discusses long-standing results and recent developments, related proof techniques, and connections with pseudorandom generators. It also suggests several research directions.<\/jats:p>","DOI":"10.1145\/1515698.1515709","type":"journal-article","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T15:22:19Z","timestamp":1237303339000},"page":"27-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Guest Column"],"prefix":"10.1145","volume":"40","author":[{"given":"Emanuele","family":"Viola","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA"}]}],"member":"320","published-online":{"date-parts":[[2009,2,28]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"184","volume-title":"16th Annual Conference on Computational Complexity","author":"Alon Noga","year":"2001"},{"key":"e_1_2_1_2_1","unstructured":"Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach (Draft). January 2007.  Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach (Draft). January 2007."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215346"},{"issue":"3","key":"e_1_2_1_4_1","first-page":"289","article-title":"Simple constructions of almost k-wise independent random variables. Random Structures &amp;","volume":"3","author":"Alon Noga","year":"1992","journal-title":"Algorithms"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374481"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336538"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2005.03.008"},{"volume-title":"Manuscript","year":"2008","author":"Ben-Eliezer Ido","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.007"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90047-M"},{"volume-title":"Handbook of theoretical computer science","year":"1990","author":"Ravi","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780631"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.56"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.24"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201278"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04943-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0406009"},{"volume-title":"Wiley-Interscience","year":"2006","author":"Thomas","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","unstructured":"Devdatt Dubhashi and Alessandro Panconesi. Concentration of measure for the analysis of randomised algorithms 2005. http:\/\/www.dsi.uniroma1.it\/~ale\/papers.html.  Devdatt Dubhashi and Alessandro Panconesi. Concentration of measure for the analysis of randomised algorithms 2005. http:\/\/www.dsi.uniroma1.it\/~ale\/papers.html."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1136"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000390050065"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-001-0332-9"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.01.003"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1069"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200426"},{"key":"e_1_2_1_29_1","series-title":"NATO Science Series II: Mathematics","first-page":"1","volume-title":"Equidistribution in Number Theory, An Introduction","author":"Granville Andrew","year":"2007"},{"key":"e_1_2_1_30_1","volume-title":"Dagstuhl Seminar Proceedings, Algebraic Methods in Computational Complexity","volume":"07411","author":"Green Frederic","year":"2007"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2005.07.011"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_34"},{"key":"e_1_2_1_33_1","unstructured":"Ben Green and Terence Tao. The distribution of polynomials over finite fields with applications to the Gowers norms 2007. arXiv:0711.3191v1.  Ben Green and Terence Tao. The distribution of polynomials over finite fields with applications to the Gowers norms 2007. arXiv:0711.3191v1."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091505000325"},{"key":"e_1_2_1_35_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/978-3-540-27821-4_34","volume-title":"8th International Workshop on Randomization and Computation (RANDOM)","author":"Gutfreund Dan","year":"2004"},{"volume-title":"MIT Press","year":"1987","author":"H\u00e5stad Johan","key":"e_1_2_1_37_1"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0238-5"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01272517"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90001-D"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_55"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374455"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374454"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1993.253488"},{"issue":"6","key":"e_1_2_1_47_1","first-page":"1462","article-title":"Rudimentary predicates and Turing calculations","volume":"11","author":"Nepomnjascii Valery A.","year":"1970","journal-title":"Soviet Mathematics-Doklady"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01375474"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001602"},{"issue":"4","key":"e_1_2_1_52_1","first-page":"598","article-title":"Lower bounds on the dimension of schemes of bounded depth in a complete basis containing the logical addition function","volume":"41","author":"Razborov Alexander","year":"1987","journal-title":"Mat. Zametki"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90041-7"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250864"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374461"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08353-7_135"},{"volume-title":"Harvard University","year":"2006","author":"Viola Emanuele","key":"e_1_2_1_59_1"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/050640941"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.16"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a007"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1515698.1515709","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1515698.1515709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:44Z","timestamp":1750253924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1515698.1515709"}},"subtitle":["correlation bounds for polynomials over {0 1}"],"short-title":[],"issued":{"date-parts":[[2009,2,28]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2,28]]}},"alternative-id":["10.1145\/1515698.1515709"],"URL":"https:\/\/doi.org\/10.1145\/1515698.1515709","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2009,2,28]]},"assertion":[{"value":"2009-02-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}