Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard-Reference-Cited by-同舟云学术

Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard

Published:1996-12 Issue:4 Volume:2 Page:341-350
ISSN:1385-3139
Container-title:Reliable Computing
language:en
Short-container-title:Reliable Comput

Author:

Kreinovich V.,Lakeyev A. V.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02389894.pdf

Reference11 articles.

1. Alefeld, G. and Mayer, G.On the symmetric and unsymmetric solution set of interval systems. SIAM J. Matr. Anal. Appl.16 (1995), pp. 1223–1240.

2. Alefeld, G. and Herzberger, J.Introduction to interval computations. Academic Press, N.Y., 1983.

3. Garey, M. E. and Johnson, D. S.Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, 1979.

4. Jansson, C.Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side. Computing46 (1991), pp. 265–274.

5. Kreinovich, V., Lakeyev, A. V., and Noskov, S. I.Optimal solution of interval linear systems is intractable (NP-hard). Interval Computations1 (1993), pp. 6–14.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Interval Methods for Solving Various Kinds of Quantified Nonlinear Problems;Studies in Computational Intelligence;2020

2. Direct and iterative methods for interval parametric algebraic systems producing parametric solutions;Numerical Linear Algebra with Applications;2019-01-21

3. Branch-and-Bound-Type Methods;Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems;2019

4. Interval mathematics, algebraic equations and optimization;Journal of Computational and Applied Mathematics;2000-12

5. Intelligent control in space exploration;ACM SIGNUM Newsletter;1997-04