{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:03Z","timestamp":1781031423095,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800875","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1672-1683","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Read-Once Determinants and the Principal Minor Assignment Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1820-3357","authenticated-orcid":false,"given":"Abhiram","family":"Aravind","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7855-7886","authenticated-orcid":false,"given":"Abhranil","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"IIT Kharagpur, Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4892-4210","authenticated-orcid":false,"given":"Sumanta","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8623-0872","authenticated-orcid":false,"given":"Rohit","family":"Gurjar","sequence":"additional","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5573-8063","authenticated-orcid":false,"given":"Roshan","family":"Raj","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7496-7396","authenticated-orcid":false,"given":"Chandan","family":"Saha","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Abeer Al Ahmadieh. 2023. The Fiber of the Principal Minor Map. arxiv:2309.00806. arxiv:2309.00806"},{"key":"e_1_3_2_1_2_1","unstructured":"Abhiram Aravind Abhranil Chatterjee Sumanta Ghosh Rohit Gurjar Roshan Raj and Chandan Saha. 2026. Learning Read-Once Determinants and the Principal Minor Assignment Problem. arxiv:2603.04255. arxiv:2603.04255"},{"key":"e_1_3_2_1_3_1","volume-title":"FCT 2015, Gda\u0144sk, Poland, August 17-19, 2015, Proceedings, Adrian Kosowski and Igor Walukiewicz (Eds.) (Lecture Notes in Computer Science","volume":"105","author":"Aravind N. R.","unstructured":"N. R. Aravind and Pushkar S. Joglekar. 2015. On the Expressive Power of Read-Once Determinants. In Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gda\u0144sk, Poland, August 17-19, 2015, Proceedings, Adrian Kosowski and Igor Walukiewicz (Eds.) (Lecture Notes in Computer Science, Vol. 9210). Springer, 95\u2013105."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/337244.337257"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or and Prasoon Tiwari. 1988. A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, Janos Simon (Ed.). ACM, 301\u2013309."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.07.024"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.3346"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3327757.3327838"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2024.09.004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979223664X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2410.01961"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718146"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205040"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90234-7"},{"key":"e_1_3_2_1_17_1","volume-title":"The Theory of Matrices","author":"Gantmacher F. R.","unstructured":"F. R. Gantmacher. 1960. The Theory of Matrices, Volume I. Chelsea Publishing Company, New York. Originally published in Russian; translated by K. A. Hirsch"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.04.009"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-020-00200-z"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(84)90209-X"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00492-X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a010"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings on 33rd Annual ACM Symposium on Theory of Computing","author":"Adam","year":"2001","unstructured":"Adam R. Klivans and Daniel A. Spielman. 2001. Randomness efficient identity testing of multivariate polynomials. In Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece. 216\u2013223."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000044"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(86)90015-7"},{"key":"e_1_3_2_1_26_1","volume-title":"Chic. J. Theor. Comput. Sci., 1997 (1997), Conference version appeared in the proceedings of SODA 1997","author":"Mahajan Meena","unstructured":"Meena Mahajan and V. Vinay. 1997. Determinant: Combinatorics, Algorithms, and Complexity. Chic. J. Theor. Comput. Sci., 1997 (1997), Conference version appeared in the proceedings of SODA 1997"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing","author":"Nisan Noam","year":"1991","unstructured":"Noam Nisan. 1991. Lower Bounds for Non-Commutative Computation (Extended Abstract). In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, Cris Koutsougeras and Jeffrey Scott Vitter (Eds.). ACM, 410\u2013418."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2140\/ant.2011.5.75"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.04.019"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2014.v010a018"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning -","volume":"70","author":"Urschel John","year":"2017","unstructured":"John Urschel, Victor-Emmanuel Brunel, Ankur Moitra, and Philippe Rigollet. 2017. Learning determinantal point processes with moments and cycles. In Proceedings of the 34th International Conference on Machine Learning - Volume 70 (ICML\u201917). JMLR.org, 3511\u20133520."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"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.3800875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:59:46Z","timestamp":1781027986000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":34,"alternative-id":["10.1145\/3798129.3800875","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800875","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"}}]}}