{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:11:09Z","timestamp":1768925469637,"version":"3.49.0"},"reference-count":37,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1741615"],"award-info":[{"award-number":["CCF-1741615"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1909429"],"award-info":[{"award-number":["CCF-1909429"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006919","name":"Massachusetts Institute of Technology","doi-asserted-by":"publisher","award":["Akamai Presidential Fellowship"],"award-info":[{"award-number":["Akamai Presidential Fellowship"]}],"id":[{"id":"10.13039\/100006919","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1137\/20m1383562","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T13:51:10Z","timestamp":1661953870000},"page":"FOCS20-317-FOCS20-367","source":"Crossref","is-referenced-by-count":3,"title":["Constant Depth Formula and Partial Function Versions of MCSP Are Hard"],"prefix":"10.1137","volume":"53","author":[{"given":"Rahul","family":"Ilango","sequence":"first","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,8,31]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.011"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-40608-0_1"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.27"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.004"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138061"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.011"},{"key":"atypb8","volume-title":"31st Conference on Computational Complexity (CCC), LIPIcs. Leibniz Int. Proc. Inform. 50","author":"Carmosino M. L.","year":"2016"},{"key":"atypb9","volume-title":"The Complexity of Minimizing Disjunctive Normal Form Formulas, master's thesis","author":"Czort S. L. A.","year":"1999"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132569"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0040"},{"key":"atypb12","first-page":"143","volume":"5","author":"J.","year":"1989","journal-title":"Adv. Comput. Res."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"atypb14","first-page":"35","volume":"64","author":"J.","year":"2017","journal-title":"J. ACM"},{"key":"atypb15","volume-title":"A Duality between Depth-Three Formulas and Approximation by Depth-Two, preprint, https:\/\/arxiv.org\/abs\/1705.03588","author":"Hirahara S.","year":"2017"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00032"},{"key":"atypb17","volume-title":"33rd Computational Complexity Conference (CCC), LIPIcs. Leibniz Int. Proc. Inform. 102","author":"Hirahara S.","year":"2018"},{"key":"atypb18","volume-title":"11th Innovations in Theoretical Computer Science Conference (ITCS), LIPIcs. Leibniz Int. Proc. Inform. 151","author":"Ilango R.","year":"2020"},{"key":"atypb19","volume-title":"35th Computational Complexity Conference (CCC), LIPIcs. Leibniz Int. Proc. Inform. 169","author":"Ilango R.","year":"2020"},{"key":"atypb20","volume-title":"35th Computational Complexity Conference (CCC), LIPIcs. Leibniz Int. Proc. Inform. 169","author":"Ilango R.","year":"2020"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.37"},{"key":"atypb25","first-page":"41","volume":"105","author":"Lokshtanov D.","year":"2011","journal-title":"Bull. EATCS"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/16M1104834"},{"key":"atypb27","first-page":"5","volume":"6","author":"Lupanov O. B.","year":"1961","journal-title":"Problemy Kibernet."},{"key":"atypb28","volume-title":"Some NP-Complete Set Covering Problems, unpublished manuscript","author":"Masek W. J.","year":"1979"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316396"},{"key":"atypb30","first-page":"380","volume-title":"30th Conference on Computational Complexity (CCC), LIPIcs. Leibniz Int. Proc. Inform. 33","author":"Murray C. D.","year":"2015"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"atypb32","volume-title":"11th Innovations in Theoretical Computer Science Conference (ITCS), LIPIcs. Leibniz Int. Proc. Inform. 151","author":"Santhanam R.","year":"2020"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1984.10036"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855944"},{"key":"atypb36","volume-title":"The Complexity of Boolean Functions","author":"Wegener I.","year":"1987"},{"key":"atypb37","volume-title":"Personal communication","author":"Williams R.","year":"2020"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T15:34:14Z","timestamp":1734363254000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1383562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,31]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1137\/20M1383562"],"URL":"https:\/\/doi.org\/10.1137\/20m1383562","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,31]]}}}