A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems |
scientific article; zbMATH DE number 827505
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems |
scientific article; zbMATH DE number 827505 |
Statements
A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (English)
0 references
16 June 1996
0 references
It is shown that the recently established NP-hardness of some problems with interval-valued data has a ``bright side'' of its own: some well-known NP-hard problems (like the 3-satisfiability problem) can be reduced to interval problems and then solved by some interval computations heuristics.
0 references
NP-hardness
0 references
interval computations
0 references
heuristics
0 references
