Computational Complexity and Feasibility of Data Processing and Interval Computations - Info and Reading Options

The Open Library:

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.

Open Data:

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

Search for “Computational Complexity and Feasibility of Data Processing and Interval Computations” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Computational Complexity and Feasibility of Data Processing and Interval Computations” in Libraries Near You:

Read or borrow “Computational Complexity and Feasibility of Data Processing and Interval Computations” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Computational Complexity and Feasibility of Data Processing and Interval Computations” at a library near you.