Options
An NP-hardness result for nonlinear systems
Publikationstyp
Journal Article
Date Issued
1998-11
Sprache
English
Author(s)
Institut
TORE-URI
Journal
Volume
10
Issue
3
Start Page
345
End Page
350
Citation
Reliable Computing 10 (3): 345-350 (1998)
Publisher DOI
Scopus ID
Publisher
Kluwer
The purpose of this paper is to show that solving a simple looking nonlinear system is NP-hard, although it has many attractive features from the point of view of numerical and interval analysis.
DDC Class
510: Mathematik