{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:32Z","timestamp":1750307612663,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"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":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p>\n            Linial and Nisan [1990] asked if any polylog-wise independent distribution fools any function in AC\n            <jats:sup>0<\/jats:sup>\n            . In a recent remarkable development, Bazzi solved this problem for the case of DNF formulas. The aim of this note is to present a simplified version of his proof.\n          <\/jats:p>","DOI":"10.1145\/1490270.1490273","type":"journal-article","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T14:56:36Z","timestamp":1259592996000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["A Simple Proof of Bazzi\u2019s Theorem"],"prefix":"10.1145","volume":"1","author":[{"given":"Alexander","family":"Razborov","sequence":"first","affiliation":[{"name":"University of Chicago"}]}],"member":"320","published-online":{"date-parts":[[2009,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215346"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/070691954"},{"volume-title":"Proceedings of the 6th IEEE Conference on Structure in Complexity Theory, IEEE Computer Society Press","author":"Beigel R.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02128670"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Luby M. and Velickovic B. 1996. On deterministic approximation of DNF. Algorithmica 16 4\/5 415--433. Luby M. and Velickovic B. 1996. On deterministic approximation of DNF. Algorithmica 16 4\/5 415--433.","DOI":"10.1007\/BF01940873"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1490270.1490273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1490270.1490273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:42Z","timestamp":1750250742000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1490270.1490273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["10.1145\/1490270.1490273"],"URL":"https:\/\/doi.org\/10.1145\/1490270.1490273","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"type":"print","value":"1942-3454"},{"type":"electronic","value":"1942-3462"}],"subject":[],"published":{"date-parts":[[2009,2]]},"assertion":[{"value":"2009-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}