This article is cited in 5 papers

Algorithmic Complexity of a Problem of Idempotent Convex Geometry

S. N. Sergeev

M. V. Lomonosov Moscow State University

Abstract: Properties of the idempotently convex hull of a two-point set in a free semimodule over the idempotent semiring $R_{\max\min}$ and in a free semimodule over a linearly ordered idempotent semifield are studied. Construction algorithms for this hull are proposed.

UDC: 519.7

Received: 15.07.2002
Revised: 13.12.2002

DOI: 10.4213/mzm316

 English version: Mathematical Notes, 2003, 74:6, 848–852

Bibliographic databases:

• 
• 
•