On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-021-00713-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-021-00713-5 / rank | |||
Normal rank | |||
Latest revision as of 19:25, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of finding a sparse Wasserstein barycenter |
scientific article |
Statements
On the computational complexity of finding a sparse Wasserstein barycenter (English)
0 references
11 May 2021
0 references
Wasserstein barycenter
0 references
optimal transport
0 references
sparsity
0 references
complexity theory
0 references
3-dimensional matching
0 references
