Algorithmic complexity of a problem of idempotent convex geometry.
type: Item
instance of: scholarly article
title: Algorithmic complexity of a problem of idempotent convex geometry.
zbMATH Open document ID: 1108.52301
DOI: 10.1023/B:MATN.0000009021.18823.52
author: S. N. Sergeev
published in: Mathematical Notes
publication date: 2007-03-09T00:00:00Z
Mathematics Subject Classification ID: 52C45
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 16Y60
Mathematics Subject Classification ID: 12K10
zbMATH DE Number: 5132486
zbMATH Keywords: idempotent geometry
zbMATH Keywords: convex hull
zbMATH Keywords: semimodule
zbMATH Keywords: idempotent semiring
zbMATH Keywords: idempotent semifield
zbMATH Keywords: algorithmic complexity
MaRDI profile type: Publication
Recommended article: Q3514520
Recommended article: On the Complexity of Some Geometric Problems With Fixed Parameters
Recommended article: Q4418120
Recommended article: On a class of \(O(n^2)\) problems in computational geometry
Recommended article: On a class of \(O(n^ 2)\) problems in computational geometry
Recommended article: Recent progress and open problems in algorithmic convex geometry
Recommended article: On the complexity of the set of unconditional convex bodies
Recommended article: Complexity of Some Geometric and Topological Problems
Recommended article: Q3615800
description: scientific article; zbMATH DE number 5132486