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.
Recommendations
Cited in
(10)- Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
- NP-hard classes of linear algebraic systems with uncertainties
- Scaling a Unitary Matrix
- Nonlinear Algebra and Optimization on Rings are “Hard”
- scientific article; zbMATH DE number 7599997 (Why is no real title available?)
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- A Non-2-step Nilsystem With Linear Polynomial Complexity
- Employing the cloud for finding solutions to large systems of nonlinear equations
- Generalized analysis of methods for solving systems of nonlinear equations with point and interval coefficients
- On finding all roots to systems of nonlinear equations using large language models
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)