Computationally complicated problems of numerical computations (in particular, interval computations), biofeedback, computer games, and Gulf War: an idea

Authors:
Misha Koshelev
Affiliations:
-
Venue:
ACM SIGNUM Newsletter
Year:
1996

Citing 2
Cited 0

Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data isNP-Hard

SIAM Journal on Matrix Analysis and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many problems of numerical computations are computationally intractable (or, to use a precise term from theoretical computer science, NP-hard; for precise definitions, see, e.g., [2]). From a practical viewpoint, this means that no feasible algorithm can solve all instances of such problems.