scientific article; zbMATH DE number 1775454
From MaRDI portal
Publication:4542587
zbMATH Open1027.68980MaRDI QIDQ4542587FDOQ4542587
Authors: Nathan Linial, Alex Samorodnitsky, A. Wigderson 
Publication date: 17 September 2002
Title of this publication is not available (Why is that?)
Recommendations
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- Approximating the Permanent
- Computing the permanent of (some) complex matrices
Cited In (15)
- Towards optimal running timesfor optimal transport
- On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
- Permanental bounds for nonnegative matrices via decomposition
- On complexity of matrix scaling
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
- Operator scaling: theory and applications
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- On the hardness of approximating the permanent of structured matrices
- Rank bounds for design matrices with block entries and geometric applications
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- Information geometry of operator scaling
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- Spectral analysis of matrix scaling and operator scaling
- Robust learning in social networks via matrix scaling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542587)
