On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:36, 5 March 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
