The following pages link to (Q4542587):
Displaying 14 items.
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- On complexity of matrix scaling (Q1970454) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Robust learning in social networks via matrix scaling (Q2060364) (← links)
- Information geometry of operator scaling (Q2151570) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Rank bounds for design matrices with block entries and geometric applications (Q4645030) (← links)
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory (Q4993287) (← links)
- Spectral Analysis of Matrix Scaling and Operator Scaling (Q4997323) (← links)
- Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5901079) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Towards optimal running timesfor optimal transport (Q6556151) (← links)
