Algebraic Systems and Computational Complexity Theory - Hardcover

Algebraic Systems and Computational Complexity Theory - Hardcover

$176.58


by Tse-K'o Wang (Author), Z. Wang (Author), S. Xu (Author)

Preface; H.W. Kuhn. 1. Kuhn's Algorithm for Algebraic Equations. 2. Efficiency of Kuhn's Algorithm. 3. Newton Method and Approximate Zeros. 4. A Comparison of Kuhn's Algorithm and Newton Method. 5. Incremental Algorithms and their Cost Theory. 6. Homotopy Algorithms. 7. Probabilistic Discussion on Zeros of Polynomial Mappings. 9. Piecewise Linear Algorithms. References. Index.

Number of Pages: 260
Dimensions: 0.63 x 9.21 x 6.14 IN
Illustrated: Yes
Publication Date: November 30, 1994
Shop Pay Continue Shopping

Estimated delivery: June 27 - June 30, 2026

Secure Checkout

Free Returns

Proudly USA Based

Accepted Payment Methods

American Express
Apple Pay
Diners Club
Discover
Google Pay
Mastercard
PayPal
Shop Pay
Visa