{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:14:25Z","timestamp":1758874465048,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-1908347"],"award-info":[{"award-number":["CCF-1908347"]}]},{"name":"Vetenskapsr\u00e5det"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384302","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"930-943","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On the computability of continuous maximum entropy distributions with applications"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Leake","sequence":"first","affiliation":[{"name":"KTH, Sweden"}]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"Yale University, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"FOCS\u201917: Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science","author":"Zhu Zeyuan Allen","year":"2017","unstructured":"Zeyuan Allen Zhu , Yuanzhi Li , Rafael Oliveira , and Avi Wigderson . Much faster algorithms for matrix scaling . In FOCS\u201917: Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science , 2017 . Zeyuan Allen Zhu, Yuanzhi Li, Rafael Oliveira, and Avi Wigderson. Much faster algorithms for matrix scaling. In FOCS\u201917: Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science, 2017."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3216622.3216635"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00708800"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3116660.3117012"},{"key":"e_1_3_2_1_5_1","volume-title":"Lecture Notes","author":"Ben-Tal Aharon","year":"2012","unstructured":"Aharon Ben-Tal and Arkadi Nemirovski . Optimization III : Convex analysis, nonlinear programming theory, nonlinear programming algorithms . Lecture Notes , 2012 . Aharon Ben-Tal and Arkadi Nemirovski. Optimization III: Convex analysis, nonlinear programming theory, nonlinear programming algorithms. Lecture Notes, 2012."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342874"},{"key":"e_1_3_2_1_7_1","first-page":"279","volume-title":"Proceedings of The 28th Conference on Learning Theory, volume 40 of Proceedings of Machine Learning Research","author":"Bubeck S\u00e9bastien","year":"2015","unstructured":"S\u00e9bastien Bubeck and Ronen Eldan . The entropic barrier: a simple and optimal universal self-concordant barrier . In Proceedings of The 28th Conference on Learning Theory, volume 40 of Proceedings of Machine Learning Research , pages 279\u2013 279 , Paris, France, 03\u2013 06 Jul 2015 . PMLR. S\u00e9bastien Bubeck and Ronen Eldan. The entropic barrier: a simple and optimal universal self-concordant barrier. In Proceedings of The 28th Conference on Learning Theory, volume 40 of Proceedings of Machine Learning Research, pages 279\u2013279, Paris, France, 03\u201306 Jul 2015. PMLR."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00088"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9574.00056"},{"key":"e_1_3_2_1_10_1","volume-title":"Eigenvalue distributions of reduced density matrices. Communications in mathematical physics, 332(1):1\u201352","author":"Christandl Matthias","year":"2014","unstructured":"Matthias Christandl , Brent Doran , Stavros Kousidis , and Michael Walter . Eigenvalue distributions of reduced density matrices. Communications in mathematical physics, 332(1):1\u201352 , 2014 . Matthias Christandl, Brent Doran, Stavros Kousidis, and Michael Walter. Eigenvalue distributions of reduced density matrices. Communications in mathematical physics, 332(1):1\u201352, 2014."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.88"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01399506"},{"key":"e_1_3_2_1_13_1","first-page":"68","volume-title":"Foundations of Computational Mathematics","author":"Garg Ankit","year":"2015","unstructured":"Ankit Garg , Leonid Gurvits , Rafael Oliveira , and Avi Wigderson . Operator scaling: theory and applications . Foundations of Computational Mathematics , pages 1\u2013 68 , 2015 . Ankit Garg, Leonid Gurvits, Rafael Oliveira, and Avi Wigderson. Operator scaling: theory and applications. Foundations of Computational Mathematics, pages 1\u201368, 2015."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_15_1","first-page":"38","volume-title":"Convex sets and Kahler manifolds","author":"Gromov M.","unstructured":"M. Gromov . Convex sets and Kahler manifolds , pages 1\u2013 38 . 1990. M. Gromov. Convex sets and Kahler manifolds, pages 1\u201338. 1990."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2872135.2872141"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S105262349529180X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3113605.3113846"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0083-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/2372387"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1198\/jcgs.2009.07177"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2372705"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.524438"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.106.620"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.108.171"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01610.x"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-006-0588-1"},{"key":"e_1_3_2_1_28_1","volume-title":"Lie groups beyond an introduction","author":"Knapp Anthony W","year":"2013","unstructured":"Anthony W Knapp . Lie groups beyond an introduction , volume 140 . Springer Science & Business Media , 2013 . Anthony W Knapp. Lie groups beyond an introduction, volume 140. Springer Science & Business Media, 2013."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00709009"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2012-05403-1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1112\/S002557931100132X"},{"issue":"9","key":"e_1_3_2_1_33_1","first-page":"51","article-title":"Uber eine klasse von mittelbildungen mit anwendungen auf die determinantentheorie","volume":"22","author":"Schur Issai","year":"1923","unstructured":"Issai Schur . Uber eine klasse von mittelbildungen mit anwendungen auf die determinantentheorie . Sitzungsberichte der Berliner Mathematischen Gesellschaft , 22 ( 9-20 ): 51 , 1923 . Issai Schur. Uber eine klasse von mittelbildungen mit anwendungen auf die determinantentheorie. Sitzungsberichte der Berliner Mathematischen Gesellschaft, 22(9-20):51, 1923.","journal-title":"Sitzungsberichte der Berliner Mathematischen Gesellschaft"},{"key":"e_1_3_2_1_34_1","first-page":"59","volume-title":"Proceedings of the 46th Annual ACM Symposium on Theory of Computing","author":"Singh Mohit","unstructured":"Mohit Singh and Nisheeth K Vishnoi . Entropy, optimization and counting . In Proceedings of the 46th Annual ACM Symposium on Theory of Computing , pages 50\u2013 59 . ACM, 2014. Mohit Singh and Nisheeth K Vishnoi. Entropy, optimization and counting. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pages 50\u201359. ACM, 2014."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0375-9601(91)90371-E"},{"key":"e_1_3_2_1_36_1","series-title":"Proceedings of Machine Learning Research","first-page":"2891","volume-title":"Proceedings of the Thirty-Second Conference on Learning Theory","author":"Straszak Damian","year":"2019","unstructured":"Damian Straszak and Nisheeth K. Vishnoi . Maximum entropy distributions: Bit complexity and stability . In Alina Beygelzimer and Daniel Hsu, editors, Proceedings of the Thirty-Second Conference on Learning Theory , volume 99 of Proceedings of Machine Learning Research , pages 2861\u2013 2891 , Phoenix, USA , 25\u201328 Jun 2019 . PMLR. Damian Straszak and Nisheeth K. Vishnoi. Maximum entropy distributions: Bit complexity and stability. In Alina Beygelzimer and Daniel Hsu, editors, Proceedings of the Thirty-Second Conference on Learning Theory, volume 99 of Proceedings of Machine Learning Research, pages 2861\u20132891, Phoenix, USA, 25\u201328 Jun 2019. PMLR."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.25.14238"},{"key":"e_1_3_2_1_38_1","volume-title":"Mathematical Foundations of Quantum Mechanics. Goldstine Printed Materials","author":"von Neumann J.","year":"1955","unstructured":"J. von Neumann and R.T. Beyer . Mathematical Foundations of Quantum Mechanics. Goldstine Printed Materials . Princeton University Press , 1955 . J. von Neumann and R.T. Beyer. Mathematical Foundations of Quantum Mechanics. Goldstine Printed Materials. Princeton University Press, 1955."}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384302","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":38,"alternative-id":["10.1145\/3357713.3384302","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384302","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}