Login / Signup
Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow.
Gerhard Heindl
Vladik Kreinovich
Anatoly V. Lakeyev
Published in:
Reliab. Comput. (1998)
Keyphrases
</>
np hard
management system
distributed systems
scheduling problem
special case
linear systems
building blocks
learning systems
closely related
optimal solution
lower bound
upper bound
worst case
complex systems
set of linear equations