• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algebraic Systems and Computational Complexity Theory

Algebraic Systems and Computational Complexity Theory

Hardcover

Series: Mathematics and Its Applications, Book 269

General ComputersGeneral MathematicsProgramming

ISBN10: 0792325338
ISBN13: 9780792325338
Publisher: Springer Nature
Published: Nov 30 1994
Pages: 260
Weight: 1.19
Height: 0.63 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics