Algorithmic complexity of a problem of idempotent convex geometry. (Q869763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic complexity of a problem of idempotent convex geometry. |
scientific article; zbMATH DE number 5132486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic complexity of a problem of idempotent convex geometry. |
scientific article; zbMATH DE number 5132486 |
Statements
Algorithmic complexity of a problem of idempotent convex geometry. (English)
0 references
9 March 2007
0 references
idempotent geometry
0 references
convex hull
0 references
semimodule
0 references
idempotent semiring
0 references
idempotent semifield
0 references
algorithmic complexity
0 references
0.8828401
0 references
0.8732644
0 references
0.8732644
0 references
0.8726926
0 references
0.8710161
0 references
0 references
