Complexity of Some Linear Problems with Interval Data

Reliable Computing

Volumn 3, Issue 3, 1997, Pages 315-323

  Rohn, Jiří ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0343624831     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009987227018     Document Type: Article

References (20)

1. Bareiss, E. F.: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination, Mathematics of Computation 103 (1968), pp. 565-578.
2. Cook, S. A.: The Complexity of Theorem-Proving Procedures, in: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1971, pp. 151-158.
3. Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
4. Garey, M. R., Johnson, D. S., and Stockmeyer, L.: Some Simplified NP-Complete Graph Problems, Theoretical Computer Science 1 (1976), pp. 237-267.
5. Gerlach, W.: Zur Lösung linearer Ungleichungssysteme bei Störung der rechten Seite und der Koeffizientenmatrix, Mathematische Operationsforschung und Statistik, Series Optimization 12 (1981), pp. 41-43.
6. Golub, G. H. and van Loan, C. F.: Matrix Computations, The Johns Hopkins University Press, Baltimore, 1983.
7. Khachiyan, L. G.: A Polynomial Algorithm in Linear Programming, Doklady Akademii Nauk SSSR 244 (1979), pp. 1093-1096 (in Russian).
8. Kozlov, M. K., Tarasov, S. P., and Khachiyan, L. G.: Polynomial Resolvability of Convex Quadratic Programming, Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 20 (4), 1980 (in Russian).
9. Lakeyev, A. V. and Kreinovich, V.: NP-Hard Classes of Linear Algebraic Systems with Uncertainties, Reliable Computing 3 (1) (1997), pp. 51-81.
10. Mráz, F.: Úloha lineárního programování s intervalovými koeficienty, West Bohemian University, 1993 (Habilitationsschrift).
11. Oettli, W. and Prager, W.: Compatibility of Approximate Solution of Linear Equations with Given Error Bounds for Coefficients and Right-Hand Sides, Numerische Mathematik 6 (1964), pp. 405-409.
12. Poljak, S. and Rohn, J.: Checking Robust Nonsingularity is NP-Hard, Mathematics of Control, Signals, and Systems 6 (1993), pp. 1-9.
13. Rohn, J.: Checking Positive Definiteness or Stability of Symmetric Interval Matrices is NP-Hard, Commentationes Mathematicae Universitatis Carolinae 35 (1994), pp. 795-797.
14. Rohn, J.: Linear Programming with Inexact Data is NP-Hard, Technical Report 642, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 1995.
15. Rohn, J.: NP-Hardness Results for Some Linear and Quadratic Problems, Technical Report 619, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 1995.
16. Rohn, J.: Checking Properties of Interval Matrices, Technical Report 686, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 1996.
17. Rohn, J.: Complexity of Solving Linear Interval Equations, Zeitschrift für Angewandte Mathematik und Mechanik, Supplement 3 76 (1996), pp. 271-274.
18. 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 16 (1995), pp. 415-420.
19. Rohn, J. and Kreslová, J.: Linear Interval Inequalities, Linear and Multilinear Algebra 38 (1994), pp. 79-82.
20. Rohn, J. and Rex, G.: Interval P-Matrices, SIAM Journal on Matrix Analysis and Applications 17 (1996), pp. 1020-1024.