Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 4 of 203877 results
Sort by: relevance publication year

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

JOURNAL ARTICLE published December 1996 in Reliable Computing

Authors: V. Kreinovich | A. V. Lakeyev

https://doi.org/10.1007/bf02389894 Actions

In the General Case, the Basic Problem of Interval Computations is Intractable

BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations

Authors: Vladik Kreinovich | Anatoly Lakeyev | Jiří Rohn | Patrick Kahl

https://doi.org/10.1007/978-1-4757-2793-7_3 Actions

Interval linear systems with prescribed column sums

JOURNAL ARTICLE published August 1981 in Linear Algebra and its Applications

Authors: Jiří Rohn

https://doi.org/10.1016/0024-3795(81)90298-6 Actions

Linear interval inequalities

JOURNAL ARTICLE published July 1994 in Linear and Multilinear Algebra

Authors: Ji[rcirc]í Rohn | Jana KreslovÁ

https://doi.org/10.1080/03081089508818341 Actions

Optimal interval enclosures for fractionally-linear functions, and their application to intelligent control

JOURNAL ARTICLE published September 1996 in Reliable Computing

Authors: R. N. Lea | V. Kreinovich | R. Trejo

https://doi.org/10.1007/bf02391700 Actions

Complexity of Linear Optimization Problems with Integer Data

BOOK CHAPTER published in Numerical Optimization

https://doi.org/10.1007/978-3-540-35447-5_25 Actions

What if Quantities are Discrete?

BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations

Authors: Vladik Kreinovich | Anatoly Lakeyev | Jiří Rohn | Patrick Kahl

https://doi.org/10.1007/978-1-4757-2793-7_25 Actions

Some Natural Unsolvable Problems

BOOK CHAPTER published 1997 in Computability and Complexity

https://doi.org/10.7551/mitpress/2003.003.0014 Actions

Discrete Optimization Problems with Interval Data: Pareto Set of Solutions or Set of Weak Solutions?

JOURNAL ARTICLE published December 2004 in Reliable Computing

Authors: Galina Kozina

https://doi.org/10.1023/b:reom.0000047095.22096.16 Actions

Inner solutions of linear interval systems

BOOK CHAPTER published 1986 in Interval Mathematics 1985

Authors: J. Rohn

https://doi.org/10.1007/3-540-16437-5_15 Actions

Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems

JOURNAL ARTICLE published 5 March 2007 in Reliable Computing

Authors: Daniel J. Berleant | Olga Kosheleva | Vladik Kreinovich | Hung T. Nguyen

https://doi.org/10.1007/s11155-006-9031-4 Actions

Bounds on Generalized Linear Predictors with Incomplete Outcome Data

JOURNAL ARTICLE published 5 March 2007 in Reliable Computing

Authors: Jörg Stoye

https://doi.org/10.1007/s11155-006-9030-5 Actions

A general iterative sparse linear solver and its parallelization for interval Newton methods

JOURNAL ARTICLE published September 1995 in Reliable Computing

Authors: Chenyi Hu | Anna Frolov | R. Baker Kearfott | Qing Yang

https://doi.org/10.1007/bf02385256 Actions

Inverse interval matrix: A survey

JOURNAL ARTICLE published 1 January 2011 in The Electronic Journal of Linear Algebra

Authors: Jiri Rohn | Raena Farhadsefat

https://doi.org/10.13001/1081-3810.1468 Actions

Engineering Corollary: Signal Processing is NP-Hard

BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations

Authors: Vladik Kreinovich | Anatoly Lakeyev | Jiří Rohn | Patrick Kahl

https://doi.org/10.1007/978-1-4757-2793-7_14 Actions

On the speed of convergence of the total step iterative method for a class of interval linear algebraic systems

JOURNAL ARTICLE published December 1996 in Reliable Computing

Authors: Marina A. Lyashko

https://doi.org/10.1007/bf02389895 Actions

Exact Bounds on Finite Populations of Interval Data

JOURNAL ARTICLE published June 2005 in Reliable Computing

Authors: Scott Ferson | Lev Ginzburg | Vladik Kreinovich | Luc Longpré | Monica Aviles

https://doi.org/10.1007/s11155-005-3616-1 Actions

Error Estimation for Indirect Measurements: Interval Computation Problem is (Slightly) Harder than a Similar Probabilistic Computational Problem

BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations

Authors: Vladik Kreinovich | Anatoly Lakeyev | Jiří Rohn | Patrick Kahl

https://doi.org/10.1007/978-1-4757-2793-7_26 Actions

Linear Interval Equations: Computing Enclosures with Bounded Relative Overestimation is NP-Hard

BOOK CHAPTER published 1996 in Applied Optimization

Authors: Jiří Rohn

https://doi.org/10.1007/978-1-4613-3440-8_4 Actions

An asymptotic result for linear interval systems

JOURNAL ARTICLE published June 1989 in BIT

Authors: J. Rohn

https://doi.org/10.1007/bf01952693 Actions
Feedback: support@crossref.org