Skip to main content
SpringerLink
Log in

Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow

  • Published:
Reliable Computing

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to Theory of NP-Completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  2. Kreinovich, V., Lakeyev, A. V., and Noskov, S. I.: Optimal Solution of Interval Linear Systems Is Intractable (NP-Hard), Interval Computations 1 (1993), pp. 6–14.

    Google Scholar 

  3. Rohn, J.: Linear Interval Equations: Computing Enclosures with Bounded Relative Overestimation Is NP-Hard, in: Kearfott, R. B. and Kreinovich, V. (eds), Applications of Interval Computations, Kluwer, Boston, MA, 1996, pp. 81–89.

    Google Scholar 

  4. Rohn, J. and Kreinovich, V.: Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data Is NP-Hard, SIAM Journal on Matrix Analysis and Applications (SIMAX) 16 (1995), pp. 415–420.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Bergische Universität GH Wuppertal, Gaussstr. 20, 42097, Wuppertal, Germany, e-mail

    Gerhard Heindl

  2. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79968, USA, e-mail

    Vladik Kreinovich

  3. Irkutsk Computing Center, Russian Academy of Science, Siberian Branch, Lermontov Str. 134, Irkutsk, 664033, Russia, e-mail

    Anatoly V. Lakeyev

Authors
  1. Gerhard Heindl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladik Kreinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anatoly V. Lakeyev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heindl, G., Kreinovich, V. & Lakeyev, A.V. Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow. Reliable Computing 4, 383–388 (1998). https://doi.org/10.1023/A:1024423917616

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024423917616

Keywords

Search

Navigation