Algebraic algorithms using p-adic constructions

Machine computation of many algebraic operations of interest and utility to mathematicians and scientists has received increasing attention in the recent years. A variety of terminology has been used to describe this area of mathematical computation. Among these are symbolic manipulation, computer algebra, algebraic methods, constructive algebra, and seminumerical algorithms. Whatever name is chosen for the field currently known as symbolic and algebraic manipulation, the most fundamental part of any symbolic computer software system for the actual computing is always the workhorse subpackage that deals with polynomial and rational functions.

[1]  David Y. Y. Yun,et al.  The Hensel Lemma in Algebraic Manipulation , 1973, Outstanding Dissertations in the Computer Sciences.

[2]  H. T. Kung.  On computing reciprocals of power series , 1974 .

[3]  David Y. Y. Yun,et al.  The EZ GCD algorithm , 1973, ACM Annual Conference.

[4]  W. S. Brown.  On Euclid's algorithm and the computation of polynomial greatest common divisors , 1971, SYMSAC '71.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  D. Musser.  Algorithms for polynomial factorization. , 1971 .

[7]  E. Horowitz.  Algorithms for partial fraction decomposition and rational function integration , 1971, SYMSAC '71.

[8]  David Y. Y. Yun,et al.  On square-free decomposition algorithms , 1976, SYMSAC '76.

[9]  John D. Lipson.  Newton's method: a great algebraic algorithm , 1976, SYMSAC '76.

[10]  David Y. Y. Yun.  A p-adic division with remainder algorithm , 1974, SIGS.

[11]  H. Zassenhaus.  On Hensel factorization, I , 1969 .

[12]  Paul S. Wang,et al.  Factoring multivariate polynomials over the integers , 1973, SIGS.

[13]  H. T. Kung,et al.  Fast Algorithms for Manipulating Formal Power Series , 1978, JACM.

[14]  Robert T. Moenck,et al.  Fast computation of GCDs , 1973, STOC.

[15]  Richard J. Fateman.  On the Computation of Powers of Sparse Polynomials , 1974 .

[16]  David Y. Y. Yun,et al.  Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms , 1974, SIGS.

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[18]  David R. Musser,et al.  Multivariate Polynomial Factorization , 1975, JACM.

[19]  W. Morven Gentleman,et al.  Analysis of algorithms, a case study: Determinants of polynomials , 1973, STOC '73.

[20]  H. T. Kung,et al.  Fast Algorithms for Partial Fraction Decomposition , 1977, SIAM J. Comput..

[21]  Michael Willett,et al.  Factoring Polynomials over a Finite Field , 1978 .

[22]  E. Berlekamp.  Factoring polynomials over finite fields , 1967 .

[23]  George E. Collins.  Polynomial Remainder Sequences and Determinants , 1966 .