{
"item_title" : "Algebraic Systems and Computational Complexity Theory",
"item_author" : [" Tse-K'o Wang", "Z. Wang", "S. Xu "],
"item_description" : "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.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/79/232/533/0792325338_b.jpg",
"price_data" : {
"retail_price" : "109.00", "online_price" : "109.00", "our_price" : "109.00", "club_price" : "109.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Algebraic Systems and Computational Complexity Theory
Overview
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.
This item is Non-Returnable
Customers Also Bought
- 1
Details
- ISBN-13: 9780792325338
- ISBN-10: 0792325338
- Publisher: Science Press
- Publish Date: November 1994
- Dimensions: 9.21 x 6.14 x 0.63 inches
- Shipping Weight: 1.19 pounds
- Page Count: 260
Related Categories
You May Also Like...
- 1
