A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
From MaRDI portal
Publication:3191970
DOI10.1145/335305.335311zbMath1296.68068OpenAlexW2052125266MaRDI QIDQ3191970
Alex Samorodnitsky, Leonid Gurvits
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335311
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
The Van der Waerden conjecture for mixed discriminants, Classical complexity and quantum entanglement, Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling, A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, Operator scaling: theory and applications, Spectral Analysis of Matrix Scaling and Operator Scaling, Bézout-Type Inequality in Convex Geometry