Solving linear interval systems is NP-hard even if we exclude overflow and underflow
type: Item
instance of: scholarly article
title: Solving linear interval systems is NP-hard even if we exclude overflow and underflow
zbMATH Open document ID: 0920.65012
DOI: 10.1023/A:1024423917616
author: G. Heindl
author: A. V. Lakeyev
author: Vladik Kreinovich
published in: Reliable Computing
publication date: 1999-09-09T00:00:00Z
review text: The complexity of the solution of linear interval systems is considered with special attention to computer arithmetic.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65G30
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1240632
zbMATH Keywords: linear interval systems
zbMATH Keywords: interval arithmetic
zbMATH Keywords: complexity
zbMATH Keywords: NP-hard
reviewed by: Svetoslav Markov
MaRDI profile type: Publication
full work available at URL: a:1024423917616
OpenAlex ID: W1514614346
Recommended article: Q4851401
Recommended article: Enclosing solutions of linear interval equations is NP-hard
Recommended article: Checking bounds on solutions of linear interval equations is NP-hard
Recommended article: Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
Recommended article: Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
Recommended article: Q4874515
Recommended article: Q4321544
Recommended article: Solving overdetermined systems of interval linear equations
Recommended article: NP-hardness of approximately solving linear equations over reals
Recommended article: On the solution of interval linear systems
description: scientific article; zbMATH DE number 1240632