Number of the records: 1
Computational Complexity of Interval Algebraic Problems: Some Are Feasible and Some Are Computationally Intractable - A Survey
- 1.0402864 - UIVT-O 200054 DE eng C - Conference Paper (international conference)
Kreinovich, V. - Lakeyev, A. - Rohn, Jiří
Computational Complexity of Interval Algebraic Problems: Some Are Feasible and Some Are Computationally Intractable - A Survey.
Proceedings of SCAN-95. Berlin: AkademieVerlag, 1996 - (Alefeld, G.; Frommer, A.; Lang, B.), s. 293-306. Mathematical Research, 90. ISBN 3-05-501737-4.
[SCAN 95. International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics. Wuppertal (DE), 26.09.1995-29.09.1995]
R&D Projects: GA ČR GA201/95/1484
Grant - others:NASA(US) NAG 9-757
Permanent Link: http://hdl.handle.net/11104/0123239
Number of the records: 1