Computing error bounds for linear inequality systems is co-NP-complete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity of Error Bounds for Systems of Linear Inequalities
Computing error bounds for linear inequality systems is co-NP-complete.