Computational complexity and feasibility of data processing and interval computations
Vladik Kreinovich, V. Kreinovich, A.V. Lakeyev, J. Rohn · 1997
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. As an Amazon Associate we earn from qualifying purchases.
About the book
The input data for data processing algorithms come from measurements and are hence not precise. We therefore need to estimate the accuracy of the results of data processing. It turns out that even for the simplest data processing algorithms, this problem is, in general, intractable. This book describes for what classes of problems interval computations (i.e. data processing with automatic results verification) are feasible, and when they are intractable. This knowledge is important, e.g. for algorithm developers, because it will enable them to concentrate on the classes of problems for which general algorithms are possible.
Book details
- Year
- 1997
- Language
- English
- Publisher
- Springer
- Editions
- 4
- Pages
- 472
- ISBN
- 9780792348658
Data source: Wikidata
More by Vladik Kreinovich
