×







We sell 100% Genuine & New Books only!

Effective Polynomial Computation 1993 Edition at Meripustak

Effective Polynomial Computation 1993 Edition by Richard Zippel , Springer

Books from same Author: Richard Zippel

Books from same Publisher: Springer

Related Category: Author List / Publisher List


  • Price: ₹ 16026.00/- [ 11.00% off ]

    Seller Price: ₹ 14264.00

Estimated Delivery Time : 4-5 Business Days

Sold By: Meripustak      Click for Bulk Order

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

We deliver across all postal codes in India

Orders Outside India


Add To Cart


Outside India Order Estimated Delivery Time
7-10 Business Days


  • We Deliver Across 100+ Countries

  • MeriPustak’s Books are 100% New & Original
  • General Information  
    Author(s)Richard Zippel
    PublisherSpringer
    ISBN9780792393757
    Pages363
    BindingHardback
    LanguageEnglish
    Publish YearAugust 1993

    Description

    Springer Effective Polynomial Computation 1993 Edition by Richard Zippel

    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. Table of contents : 1. Euclid's Algorithm. 2. Continued Fractions. 3. Diophantine Equations. 4. Lattice Techniques. 5. Arithmetic Functions. 6. Residue Rings. 7. Polynomial Arithmetic. 8. Polynomial GCD's: Classical Algorithms. 9. Polynomial Elimination. 10. Formal Power Series. 11. Bounds on Polynomials. 12. Zero Equivalence Testing. 13. Univariate Interpolation. 14. Multivariate Interpolation. 15. Polynomial GCD's: Interpolation Algorithms. 16. Hensel Algorithms. 17. Sparse Hensel Algorithms. 18. Factoring over Finite Fields. 19. Irreducibility of Polynomials. 20. Univariate Factorization. 21. Multivariate Factorization. List of Symbols. Bibliography. Index.



    Book Successfully Added To Your Cart