Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, New York, 1983.
Gaganov, A.: Computational Complexity of the Range of the Polynomial in Several Variables, Cybernetics (1985), pp. 418–421.
Garey, M. and Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, New York, Basel, Hong Kong, 1992.
Kreinovich, V., Lakeyev, A., Rohn, J., and Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations, Kluwer Academic Publishers, 1998.
Lakeyev, A.: On the Computational Complexity of the Solution of Linear Systems with Moduli, Reliable Computing 2(2) (1996), pp. 125–131.
Moore, R.: Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.
Neumaier, A.: Interval Methods for Systems of Equations, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, 1990.
Poljak, S. and Rohn, J.: Checking Robust Nonsingularity Is NP-Hard, Math. of Control, Signals, and Systems 6 (1993), pp. 1–9.
Rohn, J.: NP-Hardness Results for Linear Algebraic Problems with Interval Data, in: Herzberger, J. (ed.): Topics in Validated Computations—Studies in Computational Mathematics, Elsevier, Amsterdam, 1994, pp. 463–472.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jansson, C. An NP-Hardness Result for Nonlinear Systems. Reliable Computing 4, 345–350 (1998). https://doi.org/10.1023/A:1024463631728
Issue Date:
DOI: https://doi.org/10.1023/A:1024463631728