ShopSpell

Computational Complexity and Feasibility of Data Processing and Interval Computations [Hardcover]

$150.99     $219.99   31% Off      (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Kreinovich, V., Lakeyev, A.V., Rohn, J., Kahl, P.T.
  • Author:  Kreinovich, V., Lakeyev, A.V., Rohn, J., Kahl, P.T.
  • ISBN-10:  0792348656
  • ISBN-10:  0792348656
  • ISBN-13:  9780792348658
  • ISBN-13:  9780792348658
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-Feb-1997
  • Pub Date:  01-Feb-1997
  • SKU:  0792348656-11-SPRI
  • SKU:  0792348656-11-SPRI
  • Pages:  459
  • Pages:  459
  • Item ID: 105232670
  • List Price: $219.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 13 to Oct 15
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
Targeted audience Specialists in numerical computations, especially in numerical optimiza? tion, who are interested in designing algorithms with automatie result ver? ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com? plexity of numerical computations. Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.1 Informal Introduction: Data Processing, Interval Computations, and Computational Complexity.- 2 The Notions of Feasibility and NP-Hardness: Brief Introduction.- 3 In the General Case, the Basic Problem of Interval Computations is Intractable.- 4 Basic Problem of Interval Computations for Polynomials of a Fixed Number of Variables.- 5 Basic Problem of Interval Computations for Polynomials of Fixed Order.- 6 Basic Problem of Interval Computations for Polynomials with Bounded Coefficients.- 7 Fixed Data Processing Algorithms, Varying Data: Still NP-Hard.- 8 Fixed Data, Varying Data Processing Algorithms: Stil³
Add Review