The following pages link to On complexity of matrix scaling (Q1970454):
Displaying 21 items.
- A note on optimal block-scaling of matrices (Q797956) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Scalings of matrices which have prespecified row sums and column sums via optimization (Q1123947) (← links)
- Generalized scalings satisfying linear equations (Q1123948) (← links)
- Scaling technique for partition-Nekrasov matrices (Q1732177) (← links)
- Diagonal matrix scaling is NP-hard (Q1908195) (← links)
- On the complexity of nonnegative-matrix scaling (Q1915608) (← links)
- A hierarchically low-rank optimal transport dissimilarity measure for structured data (Q2098781) (← links)
- A fast projected fixed-point algorithm for large graph matching (Q2417841) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- Scaling a Unitary Matrix (Q2938191) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- Scaling of symmetric matrices by positive diagonal congruence (Q3615518) (← links)
- On the Complexity of Matrix Balancing (Q4337392) (← links)
- (Q4721536) (← links)
- Spectral Analysis of Matrix Scaling and Operator Scaling (Q4997323) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q5240418) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
- (Q6115392) (← links)
- Apportionment with parity constraints (Q6120934) (← links)
