Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents(26 chapters)
About this book
Reviews
Mathematical Reviews, 98m
Authors and Affiliations
-
University of Texas at El Paso, USA
Vladik Kreinovich
-
Computing Center, Russian Academy of Sciences, Irkutsk, Russia
Anatoly Lakeyev
-
Charles University and Academy of Sciences, Prague, Czech Republic
Jiří Rohn
-
IBM, Tucson, USA
Patrick Kahl
Bibliographic Information
Book Title: Computational Complexity and Feasibility of Data Processing and Interval Computations
Authors: Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
Series Title: Applied Optimization
DOI: https://doi.org/10.1007/978-1-4757-2793-7
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media Dordrecht 1998
Hardcover ISBN: 978-0-7923-4865-8Published: 31 December 1997
Softcover ISBN: 978-1-4419-4785-7Published: 10 December 2010
eBook ISBN: 978-1-4757-2793-7Published: 29 June 2013
Series ISSN: 1384-6485
Edition Number: 1
Number of Pages: XII, 459
Topics: Computational Mathematics and Numerical Analysis, Theory of Computation, Optimization, Mathematical Modeling and Industrial Mathematics, Applications of Mathematics