Complexity of Tropical and Min-plus Linear Prevarieties
Complexity of Tropical and Min-plus Linear Prevarieties
复制标题
热带和最小加线性预品种的复杂性
DOI:
--
复制
发表时间:
2012
影响因子:
1.4
通讯作者:
V. Podolskii
中科院分区:
文献类型:
--
作者:
D. Grigoriev;V. Podolskii
A tropical (or min-plus) semiring is a set $${\mathbb{Z}}$$Z (or $${\mathbb{Z \cup \{\infty\}}}$$Z∪{∞}) endowed with two operations: $${\oplus}$$⊕ , which is just usual minimum, and $${\odot}$$⊙ , which is usual addition. In tropical algebra, a vector x is a solution to a polynomial $${g_1(x) \oplus g_2(x) \oplus \cdots \oplus g_k(x)}$$g1(x)⊕g2(x)⊕⋯⊕gk(x) , where the gi(x)s are tropical monomials, if the minimum in mini(gi(x)) is attained at least twice. In min-plus algebra solutions of systems of equations of the form $${g_1(x)\oplus \cdots \oplus g_k(x) = h_1(x)\oplus \cdots \oplus h_l(x)}$$g1(x)⊕⋯⊕gk(x)=h1(x)⊕⋯⊕hl(x) are studied.In this paper, we consider computational problems related to tropical linear system. We show that the solvability problem (both over $${\mathbb{Z}}$$Z and $${\mathbb{Z} \cup \{\infty\}}$$Z∪{∞}) and the problem of deciding the equivalence of two linear systems (both over $${\mathbb{Z}}$$Z and $${\mathbb{Z} \cup \{\infty\}}$$Z∪{∞}) are equivalent under polynomial-time reductions to mean payoff games and are also equivalent to analogous problems in min-plus algebra. In particular, all these problems belong to $${\mathsf{NP}\cap \mathsf{coNP}}$$NP∩coNP . Thus, we provide a tight connection of computational aspects of tropical linear algebra with mean payoff games and min-plus linear algebra. On the other hand, we show that computing the dimension of the solution space of a tropical linear system and of a min-plus linear system is $${\mathsf{NP}}$$NP -complete.