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: 9780792348658
Price: 4566 CZK
Availability: InStock

Autor: Vladik Kreinovich, A.V. Lakeyev, J. Rohn, P.T. Kahl

Jazyk:

Vazba: Pevná

Vydavatel: Springer, Berlin

Dostupnost: Skladem u dodavatele

Odesíláme za 10-13 dnů

4 566 Kč

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

Informace o knize

Autor

Vladik Kreinovich, A.V. Lakeyev, J. Rohn, P.T. Kahl

Jazyk

Angličtina

Vazba

Kniha - Pevná

Vydáno

1997

Stránek

459

EAN

9780792348658

ISBN

0792348656

Enbook ID

01395582

Vydavatel

Springer, Berlin

Hmotnost

844

Rozměry

160 x 240 x 26

Kompletní popis

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.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Computational Complexity and Feasibility of Data Processing and Interval Computations

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také