{"product_id":"algebraic-systems-and-computational-complexity-theory-hardcover","title":"Algebraic Systems and Computational Complexity Theory - Hardcover","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eTse-K'o Wang\u003c\/b\u003e (Author), \u003cb\u003eZ. Wang\u003c\/b\u003e (Author), \u003cb\u003eS. Xu\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003ePreface; 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.\u003c\/p\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 260\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.63 x 9.21 x 6.14 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e November 30, 1994\u003c\/div\u003e\n            ","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":43156665630783,"sku":"9780792325338","price":211.9,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/I2xtw4Uy0y9780792325338.webp?v=1776974169","url":"https:\/\/dhlswag.com\/products\/algebraic-systems-and-computational-complexity-theory-hardcover","provider":"BBB","version":"1.0","type":"link"}