{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:52:24Z","timestamp":1763459544803,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,14]],"date-time":"2017-01-14T00:00:00Z","timestamp":1484352000000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Government of the Russian Federation","award":["14.Z50.31.0030"],"award-info":[{"award-number":["14.Z50.31.0030"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1319051"],"award-info":[{"award-number":["1319051"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,14]]},"DOI":"10.1145\/2840728.2840755","type":"proceedings-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T09:26:11Z","timestamp":1451985971000},"page":"405-411","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Gate Elimination"],"prefix":"10.1145","author":[{"given":"Alexander","family":"Golovnev","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander S.","family":"Kulikov","sequence":"additional","affiliation":[{"name":"Russian Academy of Sciences, St. Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_34"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536426"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90029-4"},{"key":"e_1_3_2_1_4_1","unstructured":"Gil Cohen and Igor Shinkar. The complexity of DNF of parities. Technical Report 99 Electronic Colloquium on Computational Complexity 2014."},{"key":"e_1_3_2_1_5_1","volume-title":"Two structural results for low degree polynomials and applications. arXiv preprint arXiv:1404.0654","author":"Cohen Gil","year":"2014","unstructured":"Gil Cohen and Avishay Tal. Two structural results for low degree polynomials and applications. arXiv preprint arXiv:1404.0654, 2014."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.01.007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2034006.2034033"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0023-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0258-4"},{"key":"e_1_3_2_1_10_1","volume-title":"A better-than-3n lower bound for the circuit complexity of an explicit function. Electronic Colloquium on Computational Complexity (ECCC), 22:166","author":"Find Magnus Gausdal","year":"2015","unstructured":"Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, and Alexander S. Kulikov. A better-than-3n lower bound for the circuit complexity of an explicit function. Electronic Colloquium on Computational Complexity (ECCC), 22:166, 2015."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02054965"},{"key":"e_1_3_2_1_12_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald E.","year":"2015","unstructured":"Donald E. Knuth. The Art of Computer Programming, volume 4, pre-fascicle 6a. Addison-Wesley, 2015. Section 7.2.2.2. Satisfiability. Draft available at http:\/\/www-cs-faculty.stanford.edu\/uno\/fasc6a.ps.gz."},{"key":"e_1_3_2_1_13_1","volume-title":"On the logical complexity of symmetric switching functions in monotone and complete bases. Technical report","author":"Lamagna Edward A.","year":"1973","unstructured":"Edward A. Lamagna and John E. Savage. On the logical complexity of symmetric switching functions in monotone and complete bases. Technical report, Brown University, 1973."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.27"},{"key":"e_1_3_2_1_15_1","volume-title":"Extractors for affine sources with polylogarithmic entropy. Electronic Colloquium on Computational Complexity (ECCC), 22:121","author":"Li Xin","year":"2015","unstructured":"Xin Li. Extractors for affine sources with polylogarithmic entropy. Electronic Colloquium on Computational Complexity (ECCC), 22:121, 2015."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1956.5219786"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02246615"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.37"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027226"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683282"},{"key":"e_1_3_2_1_21_1","volume-title":"Personal communication","author":"Vadhan Salil","year":"2013","unstructured":"Salil Vadhan and Ryan Williams. Personal communication, 2013."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2604-9"}],"event":{"name":"ITCS'16: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"ITCS'16"},"container-title":["Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840755","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840755","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:48:22Z","timestamp":1763459302000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840755"}},"subtitle":["Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds"],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":22,"alternative-id":["10.1145\/2840728.2840755","10.1145\/2840728"],"URL":"https:\/\/doi.org\/10.1145\/2840728.2840755","relation":{},"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"2016-01-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}