Publisher description for Computational complexity and feasibility of data processing and interval computations / by Vladik Kreinovich ... [et al.].


Bibliographic record and links to related information available from the Library of Congress catalog


Information from electronic data provided by the publisher. May be incomplete or contain other coding.


Counter
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.


Library of Congress subject headings for this publication:
Computational complexity.
Numerical calculations -- Data processing.
Interval analysis (Mathematics)