scientific article; zbMATH DE number 1775454

zbMath1027.68980MaRDI QIDQ4542587

Alex Samorodnitsky, Avi Wigderson, Nathan Linial

Publication date: 17 September 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

deterministic strongly polynomial algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (11)

Information geometry of operator scaling ⋮ Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ On complexity of matrix scaling ⋮ Rank bounds for design matrices with block entries and geometric applications ⋮ Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling ⋮ Permanental bounds for nonnegative matrices via decomposition ⋮ Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids ⋮ Robust learning in social networks via matrix scaling ⋮ Operator scaling: theory and applications ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling

This page was built for publication: