Computational complexity and feasibility of data processing and interval computations

Front Cover
Kluwer Academic Publishers, Dec 31, 1997 - Mathematics - 459 pages
0 Reviews
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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

THE NOTIONS OF FEASIBILITY
23
IN THE GENERAL CASE
41
BASIC PROBLEM OF INTERVAL
53
Copyright

23 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (1997)

Kreinvoch, University of Texas at El Paso, USA.

Bibliographic information