Algorithmic Complexity of a Problem of Idempotent Convex Geometry

被引：0
|
作者：
S. N. Sergeev
机构：
[1] M. V. Lomonosov Moscow State University,
来源：
Mathematical Notes | 2003年 / 74卷
关键词：
idempotent geometry; convex hull; semimodule; idempotent semiring; idempotent semifield; algorithmic complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Properties of the idempotently convex hull of a two-point set in a free semimodule over the idempotent semiring Rmax min and in a free semimodule over a linearly ordered idempotent semifield are studied. Construction algorithms for this hull are proposed.
引用
收藏
页码：848 / 852
页数：4
相关论文
共 50 条
12345