Inbunden, Engelska, 1997
Computational Complexity and Feasibility of Data Processing and Interval Computations
Av V. Kreinovich, A.V. Lakeyev, J. Rohn, P.T. Kahl
Del 10 i serien Applied Optimization
2182 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Beskrivning
The input data for data processing algorithms come from measurements and are therefore not precise. It is therefore necessary to estimate the accuracy of the results of data processing. Even for the simplest data processing algorithms, this problem is, however, 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 for algorithm developers, because it will enable them to concentrate on the classes of problems for which general algorithms are possible.
Produktinformation
- Utgivningsdatum: 1997-12-31
- Mått: 156 x 234 x 31 mm
- Vikt: 823 g
- Format: Inbunden
- Språk: Engelska
- Serie: Applied Optimization
- Antal sidor: 459
- Upplaga: 1998
- Förlag: Kluwer Academic Publishers
- ISBN: 9780792348658
Utforska kategorier
Recensioner i media
'The book is very well organized. The book is readable, very detailed, and intelligible. Moreover, it is exciting and gripping because the reader is often surprised by unexpected results. Everyone who is interested in modern aspects of numerical computation will enjoy reading this interesting and informative work. The book is a must for everyone who is doing research in this field.' Mathematical Reviews, 98m
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.