{"product_id":"effective-polynomial-computation-von-richard-zippel","title":"Effective Polynomial Computation","description":"\n                                \n                \u003cem\u003eEffective Polynomial Computation\u003c\/em\u003e\n                                 is an introduction to  the algorithms of computer algebra. It discusses the basic algorithms  for manipulating polynomials including factoring polynomials. These  algorithms are discussed from both a theoretical and practical  perspective. Those cases where theoretically optimal algorithms are  inappropriate are discussed and the practical alternatives are  explained.\n                \n                \u003cbr\u003e\n                                  \n                \n                \u003cem\u003eEffective Polynomial Computation\u003c\/em\u003e\n                                 provides much of the  mathematical motivation of the algorithms discussed to help the reader  appreciate the mathematical mechanisms underlying the algorithms, and  so that the algorithms will not appear to be constructed out of whole  cloth.\n                \n                \u003cbr\u003e\n                                  Preparatory to the discussion of algorithms for polynomials, the first  third of this book discusses related issues in elementary number  theory. These results are either used in later algorithms (e.g. the  discussion of lattices and Diophantine approximation), or analogs of  the number theoretic algorithms are used for polynomial problems (e.g.  Euclidean algorithm and \n                \n                \u003cem\u003ep\u003c\/em\u003e\n                                -adic numbers).\n                \n                \u003cbr\u003e\n                                  Among the unique features of \n                \n                \u003cem\u003eEffective Polynomial Computation\u003c\/em\u003e\n                                 is  the detailed material on greatest common divisor and factoring  algorithms for sparse multivariate polynomials. In addition, both  deterministic and probabilistic algorithms for irreducibility testing  of polynomials are discussed.\n                \n                \u003cbr\u003e\n                            \n            \u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9781461363989\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9781461363989","offer_id":39415677321309,"sku":"9781461363989","price":160.49,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/a78c1e77-0593-41ef-b967-ca0f3b87ba96.jpg?v=1774757361","url":"https:\/\/shop.autorenwelt.de\/products\/effective-polynomial-computation-von-richard-zippel","provider":"Autorenwelt Shop","version":"1.0","type":"link"}