On the Algorithmic Complexity of Minkowski's Reconstruction Theorem (Q3839902): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:42, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Algorithmic Complexity of Minkowski's Reconstruction Theorem |
scientific article |
Statements
On the Algorithmic Complexity of Minkowski's Reconstruction Theorem (English)
0 references
10 April 2000
0 references
Minkowski-reconstruction
0 references
polytope
0 references
approximation
0 references
computational complexity
0 references
deterministic algorithm
0 references
polynomial-time algorithm
0 references
\(\#\mathbb{P}\)-hardness
0 references
computational convexity
0 references
mixed volumes
0 references
convex body
0 references
Brunn-Minkowski theory
0 references
stability theorems
0 references
convex programming
0 references
image reconstruction
0 references
extended Gaussian image
0 references
object recognition
0 references
image processing
0 references
