Computational Complexity and Feasibility of Data Processing and Interval Computations
Publisher: Springer; Springer US
Published: Dec 10, 2010
Format: paperback
Number of pages: 471
ISBN-13: 9781441947857
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.
Notes: Source title: Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization (10))