Computational Complexity and Feasibility of Data Processing and Interval Computations

číslo produktu:113744

rezervuj

Computational Complexity and Feasibility of Data Processing and Interval Computations

Kreinovich

Rok vydania: 1998

Vydavateľ: Springer

Kniha je momentálne nedostupná.

V prípade dlhodobého záujmu si urobte REZERVÁCIU a my vám odložíme žiadaný kus.

O knihe:

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.

Zaradenie do kategórii:

Podrobnosti o titule (výrobné údaje):

Vydavateľstvo: Springer

Rok vydania: 1998

ISBN: 978-0-7923-4865-8

(9780792348658)

Väzba: tvrdá