×

zbMATH — the first resource for mathematics

Computational complexity and feasibility of data processing and interval computations. (English) Zbl 0945.68077
Applied Optimization. 10. Dordrecht: Kluwer Academic Publishers. xii, 459 p. Dfl 375.00; $ 214.00; £128.00 (1998).
Publisher’s description: 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.

MSC:
68Q25 Analysis of algorithms and problem complexity
68-02 Research exposition (monographs, survey articles) pertaining to computer science
Software:
Cosy; QEPCAD; REDLOG
PDF BibTeX XML Cite