|
This article is cited in 5 scientific papers (total 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.
Received: 15.07.2002 Revised: 13.12.2002
Citation:
S. N. Sergeev, “Algorithmic Complexity of a Problem of Idempotent Convex Geometry”, Mat. Zametki, 74:6 (2003), 896–901; Math. Notes, 74:6 (2003), 848–852
Linking options:
https://www.mathnet.ru/eng/mzm316https://doi.org/10.4213/mzm316 https://www.mathnet.ru/eng/mzm/v74/i6/p896
|
Statistics & downloads: |
Abstract page: | 372 | Full-text PDF : | 195 | References: | 49 | First page: | 1 |
|