Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Computational Complexity and Feasibility of Data Processing and Interval Computations

Name: Computational Complexity and Feasibility of Data Processing and Interval Computations
Brand: Springer, Berlin
SKU: 01423219
Price: 206.0 EUR
Availability: InStock
Author: V. Kreinovich
ISBN: 9781441947857

Language

English

Book Paperback

Libristo code: 01423219

Publishers Springer, Berlin, October 2010

The input data for data processing algorithms come from measurements and are hence not precise. We t... Full description

Libristo code: 01423219

498 b

206.00 €

In stock at our supplier Shipping in 5-8 days

30-day return policy

Customers also purchased

Zur Geschichte Des Weimarischen Theaters Ernst Wilhelm Weber

Paperback

24.10 €

X-Men 4 Chris Claremont

Paperback

11.03 €

Le Nettoyeur 1 : La Liste Madsen

MP3

3.94 €

Ateliér špičatých klobouků 8 Kamome Širahama

Paperback

8.09 €

L'expérimentation de la Loi du profit nul Moe a Messavussu

Paperback

14.78 €

Forscherzeit - Themenhefte für den Sachunterricht Kristina Peter

Sheet

8.19 €

Eigenschaften Von Hochvakuumteeren, Extrakten Und Restkohlen Sowie Von Chlorierungs- Und Sulfonierungsprodukten Der Steinkohlen Carl Kröger

Paperback

53.16 €

Netzwerkmedizin Eugen Münch

Paperback

37.87 €

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.