Publications
- Linear Programming with Inexact Data is NP-Hard1998 | Faculty of Mathematics and Physics
- Computing the Norm $\|A\|_{\infty,1}$ is NP-Hard2000 | Faculty of Mathematics and Physics
- Sufficient Conditions for Regularity and Singularity of Interval Matrices1999 | Faculty of Mathematics and Physics
- An Algorithm for Checking Regularity of Interval Matrices1999 | Faculty of Mathematics and Physics
- Computational Complexity and Feasibility of Data Processing and Interval Computations1998 | Faculty of Mathematics and Physics
- On the Applicability of the Interval Gaussian Algorithm1998 | Faculty of Mathematics and Physics
- Bounds on Eigenvalues of Interval Matrices1998 | Faculty of Mathematics and Physics
- Enclosing Solutions of Linear Equations1998 | Faculty of Mathematics and Physics
- Complexity of Some Linear Problems with Interval Data1997 | Faculty of Mathematics and Physics
- On Overestimations Produced by the Interval Gaussian Algorithm1997 | Faculty of Mathematics and Physics
Loading network view...
