Computational complexity and feasibility of data processing and interval computations
by Vladik Kreinovich, V. Kreinovich, A.V. Lakeyev
Computational complexityInterval analysis (Mathematics)Numerical calculationsData processingGeneral Theory of Computing
0.0
Open LibraryAbout this book
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.
Themes & subjects
Computational complexityInterval analysis (Mathematics)Numerical calculationsData processingGeneral Theory of ComputingNumerical Analysis
Reviews
No reviews yet — be the first to write one from the Log screen.
Quotes
No quotes yet.
