Algorithmic complexity of a problem of idempotent convex geometry.

DOI10.1023/B:MATN.0000009021.18823.52zbMath1108.52301MaRDI QIDQ869763

S. N. Sergeev

Publication date: 9 March 2007

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

convex hullalgorithmic complexitysemimoduleidempotent semifieldidempotent 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)

Related Items (4)

On hyperplanes and semispaces in max-min convex geometry ⋮ On the dimension of max-min convex sets ⋮ 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

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