Mohlo by se vám také líbit

Více informací o knize Computational Complexity and Feasibility of Data Processing and Interval Computations

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 471 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science

• Plný název: Computational Complexity and Feasibility of Data Processing and Interval Computations
• Autor: V. Kreinovich, A.V. Lakeyev, J. Rohn, P.T. Kahl
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 459
• EAN: 9781441947857
• ISBN: 144194785X
• ID: 01423219
• Nakladatelství: Springer, Berlin
• Hmotnost: 916 g
• Rozměry: 240 × 160 × 24 mm
• Datum vydání: 22. October 2010

Oblíbené z jiného soudku

---

---

---