{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:32Z","timestamp":1750220972512,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"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":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316339","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"442-453","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A fixed-depth size-hierarchy theorem for AC\n            <sup>0<\/sup>\n            [\u2295] via the coin problem"],"prefix":"10.1145","author":[{"given":"Nutan","family":"Limaye","sequence":"first","affiliation":[{"name":"IIT Bombay, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karteek","family":"Sreenivasaiah","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikanth","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"IIT Bombay, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Utkarsh","family":"Tripathi","sequence":"additional","affiliation":[{"name":"IIT Bombay, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkitesh","sequence":"additional","affiliation":[{"name":"IIT Bombay, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"first-page":"150","volume-title":"STOC","author":"Aaronson Scott","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808715"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215346"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","first-page":"70","volume-title":"ICALP (1)","author":"Amano Kazuyuki"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0288-y"},{"key":"e_1_3_2_1_6_1","unstructured":"{AS92} Noga Alon and Joel Spencer. The Probabilistic Method. John Wiley &amp; Sons Inc. 1992.  {AS92} Noga Alon and Joel Spencer. The Probabilistic Method. John Wiley &amp; Sons Inc. 1992."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.007"},{"first-page":"39","volume-title":"FOCS","author":"Brody Joshua","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","series-title":"LIPIcs","first-page":"629","volume-title":"APPROX-RANDOM","author":"Cohen Gil"},{"volume-title":"33rd Computational Complexity Conference, CCC 2018","year":"2018","author":"Chattopadhyay Eshan","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","unstructured":"{CHLT18} Eshan Chattopadhyay Pooya Hatami Shachar Lovett and Avishay Tal. Pseudorandom generators from the second fourier level and applications to AC0 with parity gates. Electronic Colloquium on Computational Complexity (ECCC) 25:155 2018.  {CHLT18} Eshan Chattopadhyay Pooya Hatami Shachar Lovett and Avishay Tal. Pseudorandom generators from the second fourier level and applications to AC0 with parity gates. Electronic Colloquium on Computational Complexity (ECCC) 25:155 2018."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.33"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001599"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3095799"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010209"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808717"},{"key":"e_1_3_2_1_18_1","series-title":"LIPIcs","first-page":"47","volume-title":"FSTTCS","author":"Kopparty Swastik"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3201787"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01375474"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2683783"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","first-page":"206","volume-title":"ICALP","author":"O\u2019Donnell Ryan"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73023"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374480"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839059"},{"key":"e_1_3_2_1_28_1","series-title":"LIPIcs","first-page":"13","volume-title":"ICALP","author":"Rossman Benjamin"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.67"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1965.11"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366874"},{"first-page":"254","volume-title":"IEEE Conference on Computational Complexity","author":"Steinberger John P.","key":"e_1_3_2_1_32_1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/080735096"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-013-0076-6"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316339","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":34,"alternative-id":["10.1145\/3313276.3316339","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316339","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}