Skip to main content
SpringerLink
Log in

Why Intervals? Because If We Allow Other Sets, Tractable Problems Become Intractable

  • Published:
Reliable Computing

Abstract

We show that if we add at least one non-interval set to the family of all intervals, then some reasonable interval computation problems that were previously computationally feasible become intractable. This result provides one more motivation for using the interval family: because if we increase this family, we lose computability.

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

Similar content being viewed by others

References

  1. Gaganov, A. A.: Computational Complexity of the Range of the Polynomial in Several Variables, Cybernetics (1985), pp. 418–421.

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79968, USA

    Monica Nogueira & Amarendra Nandigam

Authors
  1. Monica Nogueira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amarendra Nandigam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Monica Nogueira.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nogueira, M., Nandigam, A. Why Intervals? Because If We Allow Other Sets, Tractable Problems Become Intractable. Reliable Computing 4, 389–394 (1998). https://doi.org/10.1023/A:1024475901686

Download citation

  • Issue Date:

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

Keywords

Search

Navigation