{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T02:24:43Z","timestamp":1783477483295,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1149888, DMS-1451191, CCF-1523816, CCF-1412958"],"award-info":[{"award-number":["CCF-1149888, DMS-1451191, CCF-1523816, CCF-1412958"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055458","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"397-409","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling"],"prefix":"10.1145","author":[{"given":"Ankit","family":"Garg","sequence":"first","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonid","family":"Gurvits","sequence":"additional","affiliation":[{"name":"City College of New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Oliveira","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[{"name":"IAS, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/971651.971653"},{"key":"e_1_3_2_2_2_1","volume-title":"Volumes of sections of cubes and related problems. Geometric Aspects of Functional Analysis","author":"Ball Keith","year":"1989","unstructured":"Keith Ball . 1989. Volumes of sections of cubes and related problems. Geometric Aspects of Functional Analysis ( 1989 ), 251\u2013260. Keith Ball. 1989. Volumes of sections of cubes and related problems. Geometric Aspects of Functional Analysis (1989), 251\u2013260."},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of the National Academy of Sciences","author":"Barak Boaz","year":"2012","unstructured":"Boaz Barak , Zeev Dvir , Avi Wigderson , and Amir Yehudayoff . 2012 . Fractional Sylvester-Gallai theorems . Proceedings of the National Academy of Sciences (2012). Boaz Barak, Zeev Dvir, Avi Wigderson, and Amir Yehudayoff. 2012. Fractional Sylvester-Gallai theorems. Proceedings of the National Academy of Sciences (2012)."},{"key":"e_1_3_2_2_4_1","unstructured":"Boaz Barak Jonathan A Kelner and David Steurer. 2014.  Boaz Barak Jonathan A Kelner and David Steurer. 2014."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591886"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746605"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002220050267"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2010.07.015"},{"key":"e_1_3_2_2_9_1","volume-title":"Behaviour of the Brascamp-Lieb constant. arXiv preprint arXiv:1605.08603","author":"Bennett Jonathan","year":"2016","unstructured":"Jonathan Bennett , Neal Bez , Michael Cowling , and Taryn Flock . 2016. Behaviour of the Brascamp-Lieb constant. arXiv preprint arXiv:1605.08603 ( 2016 ). Jonathan Bennett, Neal Bez, Michael Cowling, and Taryn Flock. 2016. Behaviour of the Brascamp-Lieb constant. arXiv preprint arXiv:1605.08603 (2016)."},{"key":"e_1_3_2_2_10_1","volume-title":"Stability of the Brascamp-Lieb constant and applications. arXiv preprint arXiv:1508.07502","author":"Bennett Jonathan","year":"2015","unstructured":"Jonathan Bennett , Neal Bez , Taryn Flock , and Sanghyuk Lee . 2015. Stability of the Brascamp-Lieb constant and applications. arXiv preprint arXiv:1508.07502 ( 2015 ). Jonathan Bennett, Neal Bez, Taryn Flock, and Sanghyuk Lee. 2015. Stability of the Brascamp-Lieb constant and applications. arXiv preprint arXiv:1508.07502 (2015)."},{"key":"e_1_3_2_2_11_1","unstructured":"Jonathan Bennett Anthony Carbery Michael Christ and Terence Tao. 2005.  Jonathan Bennett Anthony Carbery Michael Christ and Terence Tao. 2005."},{"key":"e_1_3_2_2_12_1","volume-title":"arXiv preprint arXiv:0505691","author":"FINITE BOUNDS FOR","year":"2005","unstructured":"FINITE BOUNDS FOR Holder-Brascamp-Lieb MULTILINEAR INEQUALITIES. arXiv preprint arXiv:0505691 ( 2005 ). FINITE BOUNDS FOR Holder-Brascamp-Lieb MULTILINEAR INEQUALITIES. arXiv preprint arXiv:0505691 (2005)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-007-0619-6"},{"key":"e_1_3_2_2_14_1","volume-title":"Mean value estimates for Weyl sums in two dimensions. arXiv preprint arXiv:1509.05388","author":"Bourgain Jean","year":"2015","unstructured":"Jean Bourgain and Ciprian Demeter . 2015. Mean value estimates for Weyl sums in two dimensions. arXiv preprint arXiv:1509.05388 ( 2015 ). Jean Bourgain and Ciprian Demeter. 2015. Mean value estimates for Weyl sums in two dimensions. arXiv preprint arXiv:1509.05388 (2015)."},{"key":"e_1_3_2_2_15_1","unstructured":"Jean Bourgain Ciprian Demeter and Larry Guth. 2015.  Jean Bourgain Ciprian Demeter and Larry Guth. 2015."},{"key":"e_1_3_2_2_16_1","volume-title":"Annals of Mathematics","author":"Proof","year":"2015","unstructured":"Proof of the main conjecture in Vinogradov\u2019s mean value theorem for degrees higher than three. Annals of Mathematics ( 2015 ). Proof of the main conjecture in Vinogradov\u2019s mean value theorem for degrees higher than three. Annals of Mathematics (2015)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(76)90184-5"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-009-0001-y"},{"key":"e_1_3_2_2_19_1","volume-title":"Completely positive linear maps on complex matrices. Linear Algebra and Its Applications","author":"Choi M.","year":"1975","unstructured":"M. Choi . 1975. Completely positive linear maps on complex matrices. Linear Algebra and Its Applications ( 1975 ), 285\u2013290. M. Choi. 1975. Completely positive linear maps on complex matrices. Linear Algebra and Its Applications (1975), 285\u2013290."},{"key":"e_1_3_2_2_20_1","volume-title":"Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. arXiv preprint arXiv:1308.0068","author":"Christ Michael","year":"2013","unstructured":"Michael Christ , James Demmel , Nicholas Knight , Thomas Scanlon , and Katherine Yelick . 2013. Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. arXiv preprint arXiv:1308.0068 ( 2013 ). Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, and Katherine Yelick. 2013. Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. arXiv preprint arXiv:1308.0068 (2013)."},{"key":"e_1_3_2_2_21_1","unstructured":"Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2015.  Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2015."},{"key":"e_1_3_2_2_22_1","volume-title":"arXiv preprint arXiv:1510.04190","author":"On","year":"2015","unstructured":"On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups. arXiv preprint arXiv:1510.04190 ( 2015 ). On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups. arXiv preprint arXiv:1510.04190 (2015)."},{"key":"e_1_3_2_2_23_1","first-page":"205","article-title":"Information geometry and alternating minimization procedures","volume":"1","author":"Csisz\u00e1r Imre","year":"1984","unstructured":"Imre Csisz\u00e1r and G\u00e1bor Tusn\u00e1dy . 1984 . Information geometry and alternating minimization procedures . Stat. Decis. Suppl. 1 (1984), 205 \u2013 237 . Imre Csisz\u00e1r and G\u00e1bor Tusn\u00e1dy. 1984. Information geometry and alternating minimization procedures. Stat. Decis. Suppl. 1 (1984), 205\u2013237.","journal-title":"Stat. Decis. Suppl."},{"key":"e_1_3_2_2_24_1","unstructured":"Harm Derksen. 2001.  Harm Derksen. 2001."},{"key":"e_1_3_2_2_25_1","volume-title":"Proc. Amer. Math. Soc. 129","author":"Polynomial","year":"2001","unstructured":"Polynomial bounds for rings of invariants . Proc. Amer. Math. Soc. 129 , 4 ( 2001 ), 955\u2013964. Polynomial bounds for rings of invariants. Proc. Amer. Math. Soc. 129, 4 (2001), 955\u2013964."},{"key":"e_1_3_2_2_26_1","volume-title":"Polynomial degree bounds for matrix semi-invariants. arXiv preprint arXiv:1512.03393","author":"Derksen Harm","year":"2015","unstructured":"Harm Derksen and Visu Makam . 2015. Polynomial degree bounds for matrix semi-invariants. arXiv preprint arXiv:1512.03393 ( 2015 ). Harm Derksen and Visu Makam. 2015. Polynomial degree bounds for matrix semi-invariants. arXiv preprint arXiv:1512.03393 (2015)."},{"key":"e_1_3_2_2_27_1","volume-title":"The combinatorics of quiver representations. arXiv preprint arXiv:0608288","author":"Derksen Harm","year":"2007","unstructured":"Harm Derksen and Jerzy Weyman . 2007. The combinatorics of quiver representations. arXiv preprint arXiv:0608288 ( 2007 ). Harm Derksen and Jerzy Weyman. 2007. The combinatorics of quiver representations. arXiv preprint arXiv:0608288 (2007)."},{"key":"e_1_3_2_2_28_1","volume-title":"Rank bounds for design matrices with block entries and geometric applications. arXiv preprint arXiv:1610.08923","author":"Dvir Zeev","year":"2016","unstructured":"Zeev Dvir , Ankit Garg , Rafael Oliveira , and J\u00f3zsef Solymosi . 2016. Rank bounds for design matrices with block entries and geometric applications. arXiv preprint arXiv:1610.08923 ( 2016 ). Zeev Dvir, Ankit Garg, Rafael Oliveira, and J\u00f3zsef Solymosi. 2016. Rank bounds for design matrices with block entries and geometric applications. arXiv preprint arXiv:1610.08923 (2016)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591818"},{"key":"e_1_3_2_2_30_1","unstructured":"Zeev Dvir Shubhangi Saraf and Avi Wigderson. 2014.  Zeev Dvir Shubhangi Saraf and Avi Wigderson. 2014."},{"key":"e_1_3_2_2_31_1","volume-title":"Sigma 2","author":"IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF","year":"2014","unstructured":"IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY\u2019S THEOREM. Forum of Mathematics , Sigma 2 ( 2014 ), 24. IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY\u2019S THEOREM. Forum of Mathematics, Sigma 2 (2014), 24."},{"key":"e_1_3_2_2_32_1","volume-title":"Maximum matching and a polyhedron with 0,1-vertices. Journal of research of the National Bureau of Standards 69B","author":"Edmonds Jack","year":"1965","unstructured":"Jack Edmonds . 1965. Maximum matching and a polyhedron with 0,1-vertices. Journal of research of the National Bureau of Standards 69B ( 1965 ), 125\u2013130. Jack Edmonds. 1965. Maximum matching and a polyhedron with 0,1-vertices. Journal of research of the National Bureau of Standards 69B (1965), 125\u2013130."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00019-3"},{"key":"e_1_3_2_2_34_1","unstructured":"Ankit Garg Leonid Gurvits Rafael Oliveira and Avi Wigderson. 2016.  Ankit Garg Leonid Gurvits Rafael Oliveira and Avi Wigderson. 2016."},{"key":"e_1_3_2_2_35_1","volume-title":"arXiv preprint arXiv:1607.06711","author":"Algorithmic","year":"2016","unstructured":"Algorithmic aspects of Brascamp-Lieb inequalities. arXiv preprint arXiv:1607.06711 ( 2016 ). Algorithmic aspects of Brascamp-Lieb inequalities. arXiv preprint arXiv:1607.06711 (2016)."},{"key":"e_1_3_2_2_36_1","unstructured":"Ankit Garg Leonid Gurvits Rafael Oliveira and Avi Wigderson. 2016.  Ankit Garg Leonid Gurvits Rafael Oliveira and Avi Wigderson. 2016."},{"key":"e_1_3_2_2_37_1","volume-title":"FOCS arXiv:1511.03730","author":"A","year":"2016","unstructured":"A deterministic polynomial time algorithm for non-commutative rational identity testing. FOCS arXiv:1511.03730 ( 2016 ). A deterministic polynomial time algorithm for non-commutative rational identity testing. FOCS arXiv:1511.03730 (2016)."},{"key":"e_1_3_2_2_38_1","unstructured":"Leonid Gurvits. 2004.  Leonid Gurvits. 2004."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.06.003"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335311"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"e_1_3_2_2_42_1","unstructured":"Moritz Hardt and Ankur Moitra. 2013.  Moritz Hardt and Ankur Moitra. 2013."},{"key":"e_1_3_2_2_43_1","unstructured":"Algorithms and Hardness for Robust Subspace Recovery. COLT (2013).  Algorithms and Hardness for Robust Subspace Recovery. COLT (2013)."},{"key":"e_1_3_2_2_44_1","unstructured":"Samuel B Hopkins Tselil Schramm Jonathan Shi and David Steurer. 2015.  Samuel B Hopkins Tselil Schramm Jonathan Shi and David Steurer. 2015."},{"key":"e_1_3_2_2_45_1","volume-title":"tensor decomposition and planted sparse vectors. arXiv preprint arXiv:1512.02337","author":"Fast","year":"2015","unstructured":"Fast spectral algorithms from sum-of-squares proofs : tensor decomposition and planted sparse vectors. arXiv preprint arXiv:1512.02337 ( 2015 ). Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. arXiv preprint arXiv:1512.02337 (2015)."},{"key":"e_1_3_2_2_46_1","unstructured":"G\u00e1bor Ivanyos Youming Qiao and K. V. Subrahmanyam. 2015. Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. arXiv preprint arXiv:1512.03531 (December 2015).  G\u00e1bor Ivanyos Youming Qiao and K. V. Subrahmanyam. 2015. Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. arXiv preprint arXiv:1512.03531 (December 2015)."},{"key":"e_1_3_2_2_47_1","unstructured":"G\u00e1bor Ivanyos Youming Qiao and K. V. Subrahmanyam. 2015. Non-commutative Edmonds\u2019 problem and matrix semi-invariants. http:\/\/arxiv.org\/abs\/1508.00690 (August 2015).  G\u00e1bor Ivanyos Youming Qiao and K. V. Subrahmanyam. 2015. Non-commutative Edmonds\u2019 problem and matrix semi-invariants. http:\/\/arxiv.org\/abs\/1508.00690 (August 2015)."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"e_1_3_2_2_49_1","unstructured":"Lei and Sheng. 2016. Personal Communication. (2016).  Lei and Sheng. 2016. Personal Communication. (2016)."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/0112033"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01233426"},{"key":"e_1_3_2_2_52_1","volume-title":"Smoothing Brascamp-Lieb Inequalities and Strong Converses for Common Randomness Generation. ISIT","author":"Liu Jingbo","year":"2016","unstructured":"Jingbo Liu , Thomas Courtarde , Paul Cuff , and Sergio Verdu . 2016. Smoothing Brascamp-Lieb Inequalities and Strong Converses for Common Randomness Generation. ISIT ( 2016 ). Jingbo Liu, Thomas Courtarde, Paul Cuff, and Sergio Verdu. 2016. Smoothing Brascamp-Lieb Inequalities and Strong Converses for Common Randomness Generation. ISIT (2016)."},{"key":"e_1_3_2_2_53_1","unstructured":"Tengyu Ma Jonathan Shi and David Steurer. 2016.  Tengyu Ma Jonathan Shi and David Steurer. 2016."},{"key":"e_1_3_2_2_54_1","volume-title":"arXiv preprint arXiv:1610.01980","year":"2016","unstructured":"Polynomial-time tensor decompositions with sum-of-squares. arXiv preprint arXiv:1610.01980 ( 2016 ). Polynomial-time tensor decompositions with sum-of-squares. arXiv preprint arXiv:1610.01980 (2016)."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.15"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970038715X"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897649"},{"key":"e_1_3_2_2_58_1","unstructured":"Alexander Schrijver. 2003.  Alexander Schrijver. 2003."},{"key":"e_1_3_2_2_59_1","unstructured":"Combinatorial Optimization. Vol. B. Springer.  Combinatorial Optimization. Vol. B. Springer."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-2010-045-2"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055458","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055458","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":61,"alternative-id":["10.1145\/3055399.3055458","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055458","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}