Algorithmic complexity of a problem of idempotent convex geometry.

DOI10.1023/B:MATN.0000009021.18823.52MaRDI QIDQ869763zbMATH OpenFDO

Authors S. N. Sergeev

Publication date 9 March 2007

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

convex hullidempotent semifieldsemimodulealgorithmic complexityidempotent semiringidempotent geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Semifields (12K10) Semirings (16Y60) Combinatorial complexity of geometric structures (52C45)

Recommendations

• scientific article
• On the complexity of some geometric problems with fixed parameters
• scientific article; zbMATH DE number 1961535
• On a class of \(O(n^2)\) problems in computational geometry
• On a class of \(O(n^ 2)\) problems in computational geometry
• Recent progress and open problems in algorithmic convex geometry
• On the complexity of the set of unconditional convex bodies
• Complexity of some geometric and topological problems
• scientific article; zbMATH DE number 5531985

Cited in

(5)

• Refinement of two-factor factorizations of a linear partial differential operator of arbitrary order and dimension
• An interval version of separation by semispaces in max-min convexity
• On the dimension of max-min convex sets
• scientific article; zbMATH DE number 2221682 (Why is no real title available?)
• On hyperplanes and semispaces in max-min convex geometry

This page was built for publication: Algorithmic complexity of a problem of idempotent convex geometry.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869763)