首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Algorithmic Complexity of a Problem of Idempotent Convex Geometry
Authors:Sergeev  S N
Institution:1. M. V. Lomonosov Moscow State University, Russia
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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号