Pages that link to "Item:Q6155882"
From MaRDI portal
The following pages link to Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882):
Displaying 6 items.
- The complexity of computing the Muirhead-Dalton distance (Q1013525) (← links)
- On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Wasserstein distance to independence models (Q2229747) (← links)
- Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
- Dynamic programming in probability spaces via optimal transport (Q6490242) (← links)