Algebraic Systems and Computational Complexity Theory

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.

Author: Tse-K'o Wang, Z. Wang, S. Xu
Binding Type: Hardcover
Publisher: Science Press
Published: 11/30/1994
Series: Mathematics and Its Applications #269
Pages: 260
Weight: 1.19lbs
Size: 9.21h x 6.14w x 0.63d
ISBN: 9780792325338