{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:40:03Z","timestamp":1750196403899,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["390685689"],"award-info":[{"award-number":["390685689"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451105","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"847-858","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Capacity lower bounds via productization"],"prefix":"10.1145","author":[{"given":"Leonid","family":"Gurvits","sequence":"first","affiliation":[{"name":"City College of New York, USA"}]},{"given":"Jonathan","family":"Leake","sequence":"additional","affiliation":[{"name":"TU Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188942"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055469"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00013"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-2001-020-6"},{"key":"e_1_3_2_1_5_1","volume-title":"Lorentzian polynomials. arXiv preprint arXiv:1902.03719","author":"Br\u00e4nd\u00e9n Petter","year":"2019","unstructured":"Petter Br\u00e4nd\u00e9n and June Huh. 2019. Lorentzian polynomials. arXiv preprint arXiv:1902.03719, 2019."},{"key":"e_1_3_2_1_6_1","volume-title":"The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR computational mathematics and mathematical physics, 7, 3","author":"Bregman Lev M","year":"1967","unstructured":"Lev M Bregman. 1967. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR computational mathematics and mathematical physics, 7, 3, 1967. Pages 200\u2013217."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00088"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00055"},{"key":"e_1_3_2_1_9_1","volume-title":"Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. arXiv preprint arXiv:1711.08039","author":"B\u00fcrgisser Peter","year":"2017","unstructured":"Peter B\u00fcrgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson. 2017. Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. arXiv preprint arXiv:1711.08039, 2017."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188932"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.95"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-018-0434-2"},{"key":"e_1_3_2_1_13_1","first-page":"68","volume-title":"Foundations of Computational Mathematics","author":"Garg Ankit","year":"2019","unstructured":"Ankit Garg, Leonid Gurvits, Rafael Oliveira, and Avi Wigderson. 2019. Operator scaling: theory and applications. Foundations of Computational Mathematics, 2019. Pages 1\u201368."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132578"},{"key":"e_1_3_2_1_15_1","volume-title":"one theorem for all. the electronic journal of combinatorics, 15, 1","author":"Gurvits Leonid","year":"2008","unstructured":"Leonid Gurvits. 2008. Van der Waerden\/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all. the electronic journal of combinatorics, 15, 1, 2008. Pages 66."},{"volume-title":"Advances in Combinatorial Mathematics","author":"Gurvits Leonid","key":"e_1_3_2_1_16_1","unstructured":"Leonid Gurvits. 2009. On multivariate Newton-like inequalities. In Advances in Combinatorial Mathematics. Springer. Pages 61\u201378."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9147-5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335311"},{"key":"e_1_3_2_1_19_1","volume-title":"arXiv preprint arXiv:2007.01409","author":"Karlin Anna R.","year":"2020","unstructured":"Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. 2020. A (slightly) improved approximation algorithm for metric TSP. arXiv preprint arXiv:2007.01409, 2020."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070007"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"A note on hyperbolic polynomials","volume":"23","author":"Nuij Wim","year":"1969","unstructured":"Wim Nuij. 1969. A note on hyperbolic polynomials. Math. Scand., 23, 1, 1969. Pages 69\u201372.","journal-title":"Math. Scand."},{"key":"e_1_3_2_1_22_1","volume-title":"A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics, 35, 2","author":"Sinkhorn Richard","year":"1964","unstructured":"Richard Sinkhorn. 1964. A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics, 35, 2, 1964. Pages 876\u2013879."},{"volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Pages 370\u2013383","author":"Straszak Damian","key":"e_1_3_2_1_23_1","unstructured":"Damian Straszak and Nisheeth K. Vishnoi. 2017. Real stable polynomials and matroids: Optimization and counting. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Pages 370\u2013383."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":23,"alternative-id":["10.1145\/3406325.3451105","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451105","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}