An NP-hardness result for nonlinear systems

From MaRDI portal





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.











This page was built for publication: An NP-hardness result for nonlinear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276126)