Complexity of tropical and min-plus linear prevarieties
Dima Grigoriev, Vladimir V. Podolskii

TL;DR
This paper explores the computational complexity of solving tropical and min-plus linear systems, establishing their connections to mean payoff games and proving NP-completeness for certain problems.
Contribution
It demonstrates polynomial-time reductions between tropical linear system problems and mean payoff games, and proves NP-completeness for computing solution space dimensions.
Findings
Solvability and equivalence problems are in NP ∩ coNP.
Computing the dimension of solution spaces is NP-complete.
Connections established between tropical algebra and mean payoff games.
Abstract
A tropical (or min-plus) semiring is a set (or ) endowed with two operations: , which is just usual minimum, and , which is usual addition. In tropical algebra the vector is a solution to a polynomial , where 's are tropical monomials, if the minimum in is attained at least twice. In min-plus algebra solutions of systems of equations of the form are studied. In this paper we consider computational problems related to tropical linear system. We show that the solvability problem (both over and ) and the problem of deciding the equivalence of two linear systems (both over and ) are equivalent under polynomial-time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Commutative Algebra and Its Applications · Advanced Optimization Algorithms Research
