{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:53:09Z","timestamp":1781077989097,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2019\/00163, MTR\/2019\/001226"],"award-info":[{"award-number":["MTR\/2019\/00163, MTR\/2019\/001226"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Dutch Research Council","award":["024.003.037"],"award-info":[{"award-number":["024.003.037"]}]},{"DOI":"10.13039\/501100013233","name":"Sponsored Research and Industrial Consultancy","doi-asserted-by":"publisher","award":[""],"award-info":[{"award-number":[""]}],"id":[{"id":"10.13039\/501100013233","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001502","name":"Department of Atomic Energy, Government of India","doi-asserted-by":"publisher","award":["12-R&D-TFR-5.01-0500"],"award-info":[{"award-number":["12-R&D-TFR-5.01-0500"]}],"id":[{"id":"10.13039\/501100001502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585199","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"867-880","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Randomized versus Deterministic Decision Tree Size"],"prefix":"10.1145","author":[{"given":"Arkadev","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"TIFR, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yogesh","family":"Dahiya","sequence":"additional","affiliation":[{"name":"IMSc, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikhil S.","family":"Mande","sequence":"additional","affiliation":[{"name":"QuSoft, Netherlands \/ CWI, Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[{"name":"TIFR, Mumbai, India \/ ICTS, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Swagato","family":"Sanyal","sequence":"additional","affiliation":[{"name":"IIT Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106234"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0099-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1085"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00040"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3561047"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.44"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00113"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.30"},{"key":"e_1_3_2_1_11_1","volume-title":"TR22-185","author":"Chattopadhyay Arkadev","year":"2022","unstructured":"Arkadev Chattopadhyay , Yogesh Dahiya , Nikhil S. Mande , Jaikumar Radhakrishnan , and Swagato Sanyal . 2022. Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex ., TR22-185 ( 2022 ), ECCC :TR22-185. https:\/\/eccc.weizmann.ac.il\/report\/2022\/185 Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, and Swagato Sanyal. 2022. Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex., TR22-185 (2022), ECCC:TR22-185. https:\/\/eccc.weizmann.ac.il\/report\/2022\/185"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1310153"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2021.13"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-019-00190-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2022.15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2021.15"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90001-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188838"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2021.39"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2016.5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.70"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.21"},{"key":"e_1_3_2_1_23_1","volume-title":"One-way functions, robustness, and the non-isomorphism of NP-complete sets","author":"Hartmanis Juris","year":"1813","unstructured":"Juris Hartmanis and Lane A Hemachandra . 1986. One-way functions, robustness, and the non-isomorphism of NP-complete sets . Cornell University . https:\/\/doi.org\/ 1813 \/6636 Juris Hartmanis and Lane A Hemachandra. 1986. One-way functions, robustness, and the non-isomorphism of NP-complete sets. Cornell University. https:\/\/doi.org\/1813\/6636"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.38"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316069"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2019.102722"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050005"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471469.3471479"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3450999"},{"key":"e_1_3_2_1_31_1","first-page":"2016","volume-title":"Chic. J. Theor. Comput. Sci.","author":"Kulkarni Raghav","year":"2016","unstructured":"Raghav Kulkarni and Avishay Tal . 2016 . On Fractional Block Sensitivity . Chic. J. Theor. Comput. Sci. , 2016 (2016), http:\/\/cjtcs.cs.uchicago.edu\/articles\/2016\/8\/contents.html Raghav Kulkarni and Avishay Tal. 2016. On Fractional Block Sensitivity. Chic. J. Theor. Comput. Sci., 2016 (2016), http:\/\/cjtcs.cs.uchicago.edu\/articles\/2016\/8\/contents.html"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2019.50"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.104"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1124115"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73038"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2008.04.001"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.44"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90210-5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125350"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.76"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":40,"alternative-id":["10.1145\/3564246.3585199","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585199","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}