Effective Polynomial Computation 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.
Effective Polynomial Computation 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.
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 p-adic numbers).
Among the unique features of Effective Polynomial Computation 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.
"synopsis" may belong to another edition of this title.
An introduction to the algorithms of computer algebra. 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. Much of the mathematical motivation for the algorithms is discussed to help the read
"About this title" may belong to another edition of this title.
Seller: MB Books, Derbyshire, United Kingdom
Hardcover. Condition: Good. No Jacket. Condition : Good. Ex-university library copy with associated library stamps etc. Hard cover, no jacket. 363pp. No highlighting or annotations. A clean tight copy. Seller Inventory # 942204
Seller: Chequamegon Books, Washburn, WI, U.S.A.
Hardcover. Condition: Near Fine. 363 pages; 6 1/4 x 9 1/2" This is an introduction to the algorithms of computer algebra and discusses the basic algorithms for manipulating polynomials including factoring polynomials. 3 x 3 1/2" previous owner's bookplate on front pastedown. Seller Inventory # 122339
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_481265815
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0792393759I4N00
Seller: Mooney's bookstore, Den Helder, Netherlands
Condition: As New. Seller Inventory # D5ACB2709FDD376
Quantity: 1 available
Seller: Antiquariat Bernhardt, Kassel, Germany
Condition: Sehr gut. XI, 363 S. The Kluwer International Series in Engineering and Computer Science, 241. Zust: Gutes Exemplar. Einband leicht berieben. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 676 gebundene Ausgabe gebundene Ausgabe. Seller Inventory # 489925
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 376 | Sprache: Englisch | Produktart: Bücher | Effective Polynomial Computation 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. Effective Polynomial Computation 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. 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 p-adic numbers). Among the unique features of Effective Polynomial Computation 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. Seller Inventory # 1657355/202
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 1212223-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780792393757
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780792393757_new
Quantity: Over 20 available