{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:10:06Z","timestamp":1750230606274,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006978","name":"University of California Berkeley","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006978","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1115703, CCF-1319788, CCF-0832797, 00001583"],"award-info":[{"award-number":["CCF-1115703, CCF-1319788, CCF-0832797, 00001583"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591800","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"832-841","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient deterministic approximate counting for low-degree polynomial threshold functions"],"prefix":"10.1145","author":[{"given":"Anindya","family":"De","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ"}]},{"given":"Rocco A.","family":"Servedio","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1109\/INMIC.2007.4557718"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1109\/SFCS.1985.19"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.2307\/1970980"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.5802\/aif.357"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1007\/s00440-007-0118-6"},{"key":"e_1_3_2_2_6_1","volume-title":"The number of eigenvalues of a tensor. Linear algebra and its applications, 432(2):942--952","author":"Cartwright D.","year":"2013","unstructured":"{CS13} D. Cartwright and B. Sturmfels . The number of eigenvalues of a tensor. Linear algebra and its applications, 432(2):942--952 , 2013 . {CS13} D. Cartwright and B. Sturmfels. The number of eigenvalues of a tensor. Linear algebra and its applications, 432(2):942--952, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1145\/2213977.2214043"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1007\/978-3-642-31594-7_23"},{"key":"e_1_3_2_2_9_1","volume-title":"Deterministic approximate counting for degree-2 polynomial threshold functions. manuscript","author":"De A.","year":"2013","unstructured":"{DDS13a} A. De , I. Diakonikolas , and R. Servedio . Deterministic approximate counting for degree-2 polynomial threshold functions. manuscript , 2013 . {DDS13a} A. De, I. Diakonikolas, and R. Servedio. Deterministic approximate counting for degree-2 polynomial threshold functions. manuscript, 2013."},{"key":"e_1_3_2_2_10_1","volume-title":"Deterministic approximate counting for juntas of degree-2 polynomial threshold functions. manuscript","author":"De A.","year":"2013","unstructured":"{DDS13b} A. De , I. Diakonikolas , and R. Servedio . Deterministic approximate counting for juntas of degree-2 polynomial threshold functions. manuscript , 2013 . {DDS13b} A. De, I. Diakonikolas, and R. Servedio. Deterministic approximate counting for juntas of degree-2 polynomial threshold functions. manuscript, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1145\/1806689.1806763"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.5555\/2133036.2133159"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1109\/CCC.2010.28"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1007\/BF01294459"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1007\/BF01200426"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1109\/FOCS.2011.32"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1007\/s00037-013-0068-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1109\/CCC.2010.29"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1137\/S0895480192235878"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1109\/CCC.2010.27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1109\/CCC.2011.13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_22_1","DOI":"10.1109\/FOCS.2011.16"},{"key":"e_1_3_2_2_23_1","volume-title":"The correct exponent for the gotsman-linial conjecture. CoRR, abs\/1210.1283","author":"Kane Daniel M.","year":"2012","unstructured":"{Kan12a} Daniel M. Kane . The correct exponent for the gotsman-linial conjecture. CoRR, abs\/1210.1283 , 2012 . {Kan12a} Daniel M. Kane. The correct exponent for the gotsman-linial conjecture. CoRR, abs\/1210.1283, 2012."},{"key":"e_1_3_2_2_24_1","volume-title":"A pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length. CoRR, abs\/1210.1280","author":"Kane Daniel M.","year":"2012","unstructured":"{Kan12b} Daniel M. Kane . A pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length. CoRR, abs\/1210.1280 , 2012 . {Kan12b} Daniel M. Kane. A pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length. CoRR, abs\/1210.1280, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_25_1","DOI":"10.1109\/FOCS.2012.52"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_26_1","DOI":"10.1137\/060649057"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_27_1","DOI":"10.1137\/110828812"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_28_1","DOI":"10.1214\/009117906000000421"},{"key":"e_1_3_2_2_29_1","volume-title":"Personal communication","author":"Latala R.","year":"2013","unstructured":"{Lat13} R. Latala . Personal communication , 2013 . {Lat13} R. Latala. Personal communication, 2013."},{"key":"e_1_3_2_2_30_1","volume-title":"Personal communication","author":"Ledoux M.","year":"2013","unstructured":"{Led13} M. Ledoux . Personal communication , 2013 . {Led13} M. Ledoux. Personal communication, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_31_1","DOI":"10.1007\/BF01940873"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_32_1","DOI":"10.1109\/ISTCS.1993.253488"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_33_1","DOI":"10.1109\/TEC.1961.5219204"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_34_1","DOI":"10.4007\/annals.2010.171.295"},{"key":"e_1_3_2_2_35_1","volume-title":"Perceptrons: an introduction to computational geometry","author":"Minsky M.","year":"1968","unstructured":"{MP68} M. Minsky and S. Papert . Perceptrons: an introduction to computational geometry . MIT Press , Cambridge, MA , 1968 . {MP68} M. Minsky and S. Papert. Perceptrons: an introduction to computational geometry. MIT Press, Cambridge, MA, 1968."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_36_1","DOI":"10.1016\/0016-0032(61)90702-5"},{"key":"e_1_3_2_2_37_1","volume-title":"Threshold logic and its applications","author":"Muroga S.","year":"1971","unstructured":"{Mur71} S. Muroga . Threshold logic and its applications . Wiley-Interscience , New York , 1971 . {Mur71} S. Muroga. Threshold logic and its applications. Wiley-Interscience, New York, 1971."},{"key":"e_1_3_2_2_38_1","volume-title":"Pseudorandom Generators for Polynomial Threshold Functions.","author":"Meka R.","year":"2009","unstructured":"{MZ09} R. Meka and D. Zuckerman . Pseudorandom Generators for Polynomial Threshold Functions. Available at http:\/\/arxiv.org\/abs\/0910.4122, 2009 . {MZ09} R. Meka and D. Zuckerman. Pseudorandom Generators for Polynomial Threshold Functions. Available at http:\/\/arxiv.org\/abs\/0910.4122, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_39_1","DOI":"10.1145\/1806689.1806749"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_40_1","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_2_42_1","volume-title":"Personal communication","author":"Nourdin I.","year":"2013","unstructured":"{Nou13} I. Nourdin . Personal communication , 2013 . {Nou13} I. Nourdin. Personal communication, 2013."},{"key":"e_1_3_2_2_44_1","volume-title":"Personal communication","author":"Oleszkiewicz K.","year":"2013","unstructured":"{Ole13} K. Oleszkiewicz . Personal communication , 2013 . {Ole13} K. Oleszkiewicz. Personal communication, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_45_1","DOI":"10.5555\/645721.666386"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_46_1","DOI":"10.1134\/S0032946009010062"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_47_1","DOI":"10.1007\/s00037-007-0228-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_48_1","DOI":"10.1007\/s00037-008-0242-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_49_1","DOI":"10.5555\/1747597.1748051"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_50_1","DOI":"10.1137\/100806126"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_51_1","DOI":"10.1007\/978-3-540-27821-4_37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_52_1","DOI":"10.1007\/s00037-009-0273-5"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '14","name":"STOC '14: Symposium on Theory of Computing","location":"New York New York"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:04Z","timestamp":1750229764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":50,"alternative-id":["10.1145\/2591796.2591800","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591800","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}