An NP-hardness result for nonlinear systems
type: Item
instance of: scholarly article
title: An NP-hardness result for nonlinear systems
zbMATH Open document ID: 0914.65058
DOI: 10.1023/A:1024463631728
author: Christian Jansson
published in: Reliable Computing
publication date: 1999-06-07T00:00:00Z
review text: The paper presents a system of nonlinear equations, the solution of which is NP-hard. Since it contains only linear and bilinear terms, it is simple looking and has many attractive features. On the other hand, a correspondence with a knapsack problem yields NP-hardness. Besides this, the paper contains several comments on interval analysis.
reviewed by: D. Braess
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 1240627
zbMATH Keywords: NP-hardness
zbMATH Keywords: system of nonlinear equations
zbMATH Keywords: interval analysis
MaRDI profile type: Publication
full work available at URL: a:1024463631728
OpenAlex ID: W10242137
description: scientific article; zbMATH DE number 1240627