Computational complexity and feasibility of data processing and interval computations

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.

Subjects

Series Statement

• Applied optimization ;
• v. 10

Other Editions

• Computational complexity and feasibility of data processing and interval computationsKluwer Academic Publishers1998-01-01
• Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization)HardcoverSpringer1997-12-31
• Computational Complexity and Feasibility of Data Processing and Interval ComputationspaperbackSpringer2010-12-10
• Computational Complexity and Feasibility of Data Processing and Interval ComputationsSpringer London, Limited2013-01-01