EFFECTIVE POLYNOMIAL COMPUTATION (HB 1993). This item is unavailable.
Language: English
Published by SPRINGER, 1993
- Hardcover
- New
Seller: UK BOOKS STORE, London, London, United KingdomUK BOOKS STORE
5-star seller
AbeBooks seller since March 11, 2024
International Edition
Unavailable
Hardcover
Condition: New
US$ 301.61
Item description from seller
Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Seller Inventory # CBS 9780792393757
- Title
- EFFECTIVE POLYNOMIAL COMPUTATION (HB 1993)
- Author
- ZIPPEL R.
- Publisher
- SPRINGER
- Publication year
- 1993
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0792393759
- ISBN 13
- 9780792393757
- Edition
- International Edition
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.
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.
Search results for EFFECTIVE POLYNOMIAL COMPUTATION (HB 1993)
There are 9 more copies of this bookView all results