Modern computer algebra

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany oneor two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

[1]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[2]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[3]  V. Sprindžuk,et al.  Arithmetic specializations in polynomials. , 1983 .

[4]  Lajos Rónyai,et al.  Factoring polynomials over finite fields , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Daniel Shanks,et al.  Calculation of π to 100,000 Decimals , 1962 .

[6]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

[7]  William Shanks.  Contributions to Mathematics Comprising Chiefly the Rectification of the Circle to 607 Places of Decimals , 2000 .

[8]  H. C. Williams,et al.  A $p+1$ method of factoring , 1982 .

[9]  Marvin C. Wunderlich,et al.  On the parallel generation of the residues for the continued fraction factoring algorithm , 1987 .

[10]  M. H. Protter,et al.  THE SOLUTION OF THE PROBLEM OF INTEGRATION IN FINITE TERMS , 1970 .

[11]  J. J. Sylvester,et al.  XXIII. A method of determining by mere inspection the derivatives from two equations of any degree , 1840 .

[12]  A. Wiles,et al.  Ring-Theoretic Properties of Certain Hecke Algebras , 1995 .

[13]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[14]  Claus-Peter Schnorr.  Refined Analysis and Improvements on Some Factoring Algorithms , 1982, J. Algorithms.

[15]  Gilles Villard,et al.  Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract) , 1997, ISSAC.

[16]  James H. Davenport,et al.  Integration in finite terms , 1984, SIGS.

[17]  R. Vaughan.  Bounds for the coefficients of cyclotomic polynomials. , 1975 .

[18]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[19]  Barry M. Trager,et al.  Algebraic factoring and rational function integration , 1976, SYMSAC '76.

[20]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[21]  George W. Reitwiesner.  An ENIAC Determination of π and e to more than 2000 Decimal Places , 1950 .

[22]  Claus-Peter Schnorr,et al.  A More Efficient Algorithm for Lattice Basis Reduction , 1988, J. Algorithms.

[23]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[24]  A. Slisenko.  Complexity problems in computational theory , 1981 .

[25]  R. Risch.  The problem of integration in finite terms , 1969 .

[26]  Igor E. Shparlinski,et al.  Computational and Algorithmic Problems in Finite Fields , 1992 .

[27]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[28]  Vernam.  Cipher printing telegraph systems , 1926, Journal of the A.I.E.E..

[29]  R. G. Swan,et al.  Factorization of polynomials over finite fields. , 1962 .

[30]  B. L. Waerden.  Eine Bemerkung über die Unzerlegbarkeit von Polynomen , 1930 .

[31]  Victor Y. Pan,et al.  Acceleration of Euclidean Algorithm and Rational Number Reconstruction , 2003, SIAM J. Comput..

[32]  Arnold Schönhage,et al.  Schnelle Berechnung von Kettenbruchentwicklungen , 1971, Acta Informatica.

[33]  John R. Cowles,et al.  Small Sample Algorithms for the Identification of Polynomials , 1986, J. ACM.

[34]  J. J. Sylvester,et al.  XLIV. On the explicit values of Sturm's quotients , 1853 .

[35]  B. D. Weger,et al.  Algorithms for diophantine equations , 1989 .

[36]  Jonathan P. Sorenson.  Trading Time for Space in Prime Number Sieves , 1998, ANTS.

[37]  P. Stevenhagen,et al.  Chebotarëv and his density theorem , 1996 .

[38]  C. P. Schnorr,et al.  A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..

[39]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[40]  Alexander A. Razborov,et al.  Lower bounds for the polynomial calculus , 1998, computational complexity.

[41]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1991, CACM.

[42]  D. Y. Y. Yun.  On the equivalence of polynomial GCD and squarefree factorization problems , 1977 .