You might also like

More about Computational Complexity and Feasibility of Data Processing and Interval Computations

• Book details
• Synopsis
• Trending among others

You get 523 loyalty points

Book synopsis

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

Book category Knihy po anglicky Computing & information technology Computer science

• Full title: Computational Complexity and Feasibility of Data Processing and Interval Computations
• Author: Vladik Kreinovich, A.V. Lakeyev, J. Rohn, P.T. Kahl
• Language: English
• Binding: Hardback
• Number of pages: 459
• EAN: 9780792348658
• ISBN: 0792348656
• ID: 01395582
• Publisher: Springer, Berlin
• Weight: 844 g
• Dimensions: 240 × 160 × 26 mm
• Published: 1997

Trending among others

---

---

---