Rafael Mendes de Oliveira

Shir Peleg

Akash Sengupta

Electron. Colloquium Comput. Complex., 2023

2022

Radical Sylvester-Gallai for Cubics.

[BibT_eX]

[DOI]

Akash Sengupta

Electron. Colloquium Comput. Complex., 2022

Robust Radical Sylvester-Gallai Theorem for Quadratics.

[BibT_eX]

[DOI]

Abhibhav Garg

Akash Sengupta

Electron. Colloquium Comput. Complex., 2022

2021

Near optimal sample complexity for matrix and tensor normal models via geodesic convexity.

[BibT_eX]

[DOI]

Akshay Ramachandran

CoRR, 2021

2020

Operator Scaling: Theory and Applications.

[BibT_eX]

[DOI]

Found. Comput. Math., 2020

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.

[BibT_eX]

[DOI]

Christian Ikenmeyer

Visu Makam

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Towards Optimal Depth Reductions for Syntactically Multilinear Circuits.

[BibT_eX]

[DOI]

Mrinal Kumar

Ramprasad Saptharishi

Electron. Colloquium Comput. Complex., 2019

Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings.

[BibT_eX]

[DOI]

Visu Makam

Electron. Colloquium Comput. Complex., 2019

Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes.

[BibT_eX]

[DOI]

CoRR, 2019

More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer.

[BibT_eX]

[DOI]

Visu Makam

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Recent progress on scaling algorithms and applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

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

[BibT_eX]

[DOI]

Zeyuan Allen-Zhu

Yuanzhi Li

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Barriers for Rank Methods in Arithmetic Complexity.

[BibT_eX]

[DOI]

Klim Efremenko

Electron. Colloquium Comput. Complex., 2017

Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Much Faster Algorithms for Matrix Scaling.

[BibT_eX]

[DOI]

Zeyuan Allen-Zhu

Yuanzhi Li

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound.

[BibT_eX]

[DOI]

Sivakanth Gopi

Swastik Kopparty

Noga Ron-Zewi

Shubhangi Saraf

Electron. Colloquium Comput. Complex., 2016

Algorithmic aspects of Brascamp-Lieb inequalities.

[BibT_eX]

[DOI]

CoRR, 2016

A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Factors of Low Individual Degree Polynomials.

[BibT_eX]

[DOI]