{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:33Z","timestamp":1781028273479,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"NSF","award":["CCF-2145474"],"award-info":[{"award-number":["CCF-2145474"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800802","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"874-885","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6084-4729","authenticated-orcid":false,"given":"Lijie","family":"Chen","sequence":"first","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0375-6554","authenticated-orcid":false,"given":"Avishay","family":"Tal","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1312-7338","authenticated-orcid":false,"given":"Yichuan","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32162-2_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(83)90038-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.57"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.18"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-021-00915-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2024.10"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185449"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00009"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384279"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2019.19"},{"key":"e_1_3_2_1_11_1","first-page":"16","volume-title":"Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. In 31st Conference on Computational Complexity (CCC","author":"Chen Ruiwen","year":"2016","unstructured":"Ruiwen Chen, Rahul Santhanam, and Srikanth Srinivasan. 2016. Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. In 31st Conference on Computational Complexity (CCC 2016). 1:1\u20131:35. https:\/\/dblp.org\/rec\/conf\/coco\/ChenSS16"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.33"},{"key":"e_1_3_2_1_14_1","first-page":"143","article-title":"Almost Optimal Lower Bounds for Small Depth","volume":"5","author":"H\u00e5stad Johan","year":"1989","unstructured":"Johan H\u00e5stad. 1989. Almost Optimal Lower Bounds for Small Depth Circuits. Adv. Comput. Res., 5 (1989), 143\u2013170. Randomness and Computation (S. Micali, ed.)","journal-title":"Circuits. Adv. Comput. Res."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00019"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.58"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX-RANDOM.2018.46"},{"key":"e_1_3_2_1_18_1","first-page":"16","volume-title":"Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC","author":"Kane Daniel M.","year":"2016","unstructured":"Daniel M. Kane and R. Ryan Williams. 2016. Super-linear Gate and Super-quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016). 633\u2013643. https:\/\/dblp.org\/rec\/conf\/stoc\/KaneW16"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(61)90702-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188910"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"e_1_3_2_1_22_1","volume-title":"TR15-136","author":"Sakai Takayuki","year":"2015","unstructured":"Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama. 2015. A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. Electron. Colloquium Comput. Complex., TR15-136 (2015), ECCC:TR15-136. https:\/\/eccc.weizmann.ac.il\/report\/2015\/136"},{"key":"e_1_3_2_1_23_1","volume-title":"TR16-099","author":"Sakai Takayuki","year":"2016","unstructured":"Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama. 2016. Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Electron. Colloquium Comput. Complex., TR16-099 (2016), ECCC:TR16-099. https:\/\/eccc.weizmann.ac.il\/report\/2016\/099"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_3_2_1_26_1","first-page":"110","article-title":"Realizations of linear functions by formulas using +,.,-","volume":"2","author":"Subbotovskaya Bella Abramovna","year":"1961","unstructured":"Bella Abramovna Subbotovskaya. 1961. Realizations of linear functions by formulas using +,.,-. Soviet Mathematics Doklady, 2 (1961), 110\u2013112.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_1_27_1","unstructured":"Suguru Tamaki. 2016. A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates. Electronic Colloquium on Computational Complexity (ECCC TR16-100). https:\/\/eccc.weizmann.ac.il\/report\/2016\/100\/"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188822"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806723"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.36"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591858"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2018.v014a017"},{"key":"e_1_3_2_1_33_1","volume-title":"26th Annual IEEE Symposium on Foundations of Computer Science (FOCS","author":"Chi-Chih Yao Andrew","year":"1985","unstructured":"Andrew Chi-Chih Yao. 1985. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version). In 26th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1985). IEEE Computer Society, 1\u201310."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800802","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:55:08Z","timestamp":1781027708000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":33,"alternative-id":["10.1145\/3798129.3800802","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800802","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}