{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:41Z","timestamp":1781028281650,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":65,"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":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101125652"],"award-info":[{"award-number":["101125652"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/Z534158\/1"],"award-info":[{"award-number":["EP\/Z534158\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001732","name":"Danmarks Grundforskningsfond (DNRF)","doi-asserted-by":"publisher","award":["20231101-28697"],"award-info":[{"award-number":["20231101-28697"]}],"id":[{"id":"10.13039\/501100001732","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800911","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2071-2082","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Negations Are Powerful Even in Small Depth"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0458-8767","authenticated-orcid":false,"given":"Bruno","family":"Cavalar","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1294-5103","authenticated-orcid":false,"given":"Th\u00e9o Bor\u00e9m","family":"Fabris","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3656-8844","authenticated-orcid":false,"given":"Partha","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6491-124X","authenticated-orcid":false,"given":"Srikanth","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0177-1814","authenticated-orcid":false,"given":"Amir","family":"Yehudayoff","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"},{"name":"Technion-ITT, Haifa, Israel"}],"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.1145\/31846.31852"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2025.29"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/S000370050023"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579196"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.194.3.5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00138"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-024-00248-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/S004930050058"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/070691954"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112328"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2507.16105"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2023.29"},{"key":"e_1_3_2_1_15_1","volume-title":"Partha Mukhopadhyay, Srikanth Srinivasan, and Amir Yehudayoff.","author":"Cavalar Bruno Pasqualotto","year":"2025","unstructured":"Bruno Pasqualotto Cavalar, Th\u00e9o Bor\u00e9m Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, and Amir Yehudayoff. 2025. Negations are powerful even in small depth. Electron. Colloquium Comput. Complex., TR25-219 (2025), ECCC:TR25-219. https:\/\/eccc.weizmann.ac.il\/report\/2025\/219"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-022-01000-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2022.39"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451069"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.FSTTCS.2022.12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055425"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205042"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2025.36"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.05.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1945-08454-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-35.1.85"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306208"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716307"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4086\/TOC.2020.V016A013"},{"key":"e_1_3_2_1_29_1","volume-title":"TR18-163","author":"G\u00f6\u00f6s Mika","year":"2018","unstructured":"Mika G\u00f6\u00f6s, Pritish Kamath, Robert Robere, and Dmitry Sokolov. 2018. Adventures in Monotone Complexity and TFNP. Electron. Colloquium Comput. Complex., TR18-163 (2018), ECCC:TR18-163. https:\/\/eccc.weizmann.ac.il\/report\/2018\/163"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526633.006"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335349"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.546"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2009.09.003"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.11"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2016.89"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2021.9"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-014-9574-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1196339"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9655-9"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"e_1_3_2_1_42_1","volume-title":"Graph Theory and Crystal Physics","author":"Kasteleyn P. W.","unstructured":"P. W. Kasteleyn. 1967. Graph Theory and Crystal Physics. In Graph Theory and Theoretical Physics, Frank Harary (Ed.). Academic Press, London. 43\u2013110. Chapter in edited volume"},{"key":"e_1_3_2_1_43_1","unstructured":"J. E. Littlewood and A. C. Offord. 1943. On the number of real roots of a random algebraic equation. III. Rec. Math. [Mat. Sbornik] N.S. 12(54) (1943) 277\u2013286."},{"key":"e_1_3_2_1_44_1","volume-title":"Fundamentals of Computation Theory (FCT\u201979)","author":"Lov\u00e1sz L\u00e1szl\u00f3","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz. 1979. On determinants, matchings and random algorithms. In Fundamentals of Computation Theory (FCT\u201979), L. Budach (Ed.). Akademie-Verlag, Berlin. 565\u2013574."},{"key":"e_1_3_2_1_45_1","first-page":"1997","volume-title":"Chic. J. Theor. Comput. Sci.","author":"Mahajan Meena","year":"1997","unstructured":"Meena Mahajan and V. Vinay. 1997. Determinant: Combinatorics, Algorithms, and Complexity. Chic. J. Theor. Comput. Sci., 1997 (1997), http:\/\/cjtcs.cs.uchicago.edu\/articles\/1997\/5\/contents.html"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579205"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30598-9_18"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103462"},{"key":"e_1_3_2_1_49_1","unstructured":"Elizaveta Okol\u2019nishnikova. 1982. The effect of negations on the complexity of realization of monotone Boolean functions by formulas of bounded depth. Metody Diskretnogo Analiza 74\u201380."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1090\/DIMACS\/039\/15"},{"key":"e_1_3_2_1_51_1","unstructured":"Anup Rao. 2025. The Story of Sunflowers. arxiv:2509.14790. arxiv:2509.14790"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146684"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.013"},{"key":"e_1_3_2_1_54_1","first-page":"798","article-title":"Lower bounds on the monotone complexity of some Boolean functions","volume":"281","author":"Razborov Alexander","year":"1985","unstructured":"Alexander Razborov. 1985. Lower bounds on the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR, 281, 4 (1985), 798\u2013801.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839059"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Tim Roughgarden. 2015. Communication Complexity (for Algorithm Designers). arxiv:1509.06257","DOI":"10.1561\/9781680831153"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3417758"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2017.15"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122563"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90060-2"},{"key":"e_1_3_2_1_64_1","volume-title":"Counting Labelled Trees. Canadian Mathematical Congress, Montreal.","author":"Moon J","year":"1970","unstructured":"Moon J W. 1970. Counting Labelled Trees. Canadian Mathematical Congress, Montreal."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316311"}],"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.3800911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:54:27Z","timestamp":1781027667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":65,"alternative-id":["10.1145\/3798129.3800911","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800911","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"}}]}}