Author of the publication

Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing.

, , , , and . STOC, page 172-181. ACM, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Much Faster Algorithms for Matrix Scaling., , , and . CoRR, (2017)A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing., , , and . FOCS, page 109-117. IEEE Computer Society, (2016)More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer., , , and . FOCS, page 824-844. IEEE Computer Society, (2019)Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings., , , , , and . CCC, volume 169 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Barriers for Rank Methods in Arithmetic Complexity., , , and . Electron. Colloquium Comput. Complex., (2017)Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling., , , and . STOC, page 397-409. ACM, (2017)Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes., , , , , and . FOCS, page 845-861. IEEE Computer Society, (2019)Factors of Low Individual Degree Polynomials.. CCC, volume 33 of LIPIcs, page 198-216. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Much Faster Algorithms for Matrix Scaling., , , and . FOCS, page 890-901. IEEE Computer Society, (2017)Towards Optimal Depth Reductions for Syntactically Multilinear Circuits., , and . ICALP, volume 132 of LIPIcs, page 78:1-78:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)