Title: 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: Computational complexity, Interval analysis (Mathematics), Numerical calculations, Data processing, General Theory of Computing, Numerical Analysis, Interval analysis (Mathematics, Theory Of Computing, Science/Mathematics, Mathematics, Applied, Data Processing - General, Mathematical Analysis, Computers-Data Processing - General, Mathematics / Mathematical Analysis, Mathematics / Number Systems, Mathematics-Applied, Probability & Statistics - General, Information theory, Computer science, Mathematical optimization, Computational Mathematics and Numerical Analysis, Theory of Computation, Optimization, Mathematical Modeling and Industrial Mathematics, Applications of Mathematics