Pages that link to "Item:Q1915608"
From MaRDI portal
The following pages link to On the complexity of nonnegative-matrix scaling (Q1915608):
Displaying 18 items.
- On testing Hamiltonicity of graphs (Q468434) (← links)
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices (Q1774975) (← links)
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices (Q1911415) (← links)
- On complexity of matrix scaling (Q1970454) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- A hierarchically low-rank optimal transport dissimilarity measure for structured data (Q2098781) (← links)
- Matrix scaling and explicit doubly stochastic limits (Q2321351) (← 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)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Scaling of symmetric matrices by positive diagonal congruence (Q3615518) (← links)
- (Q5240418) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5307235) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
- Apportionment with parity constraints (Q6120934) (← links)
