The paper gives the full complexity landscape for min-max linear equations, with NP-completeness for several subclasses, UP∩coUP when a halting condition holds, and PTIME for a stochastic-game subclass.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Linear Equations with Min and Max Operators: Computational Complexity
The paper gives the full complexity landscape for min-max linear equations, with NP-completeness for several subclasses, UP∩coUP when a halting condition holds, and PTIME for a stochastic-game subclass.