Algebraic Systems and Computational Complexity Theory

By Z. Wang, Tse-K'o Wang, S. Xu, et al.

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.

• Format: Hardcover
• Language: English
• ISBN: 0792325338
• ISBN13: 9780792325338
• Release Date: November 1994
• Publisher: Science Press
• Length: 260 Pages
• Weight: 1.19 lbs.
• Dimensions: 0.6" x 6.1" x 9.2"