|
Book Review
The AMS does not provide abstracts of book reviews.
You may download the entire review from the links below.
Retrieve article in:
PDF
Book Information
Author(s):
Henri Cohen
Title:
A course in computational algebraic number theory
Additional book information:
Springer-Verlag, New York, 1993, xxi+534 pp., US$49.00. ISBN 3-540-55640-0
References:
- [Be1]
- E. R. Berlekamp, Factoring polynomials over finite fields, Bell System Tech. J. \textbf{46} (1967), 1853--1859.
- [Be2]
- E. R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. \textbf{24} (1970), 713--735.
- [Bi1]
- J. Binet, Recherches sur la th\'eorie des nombres entiers et sur la r\'esolution de l'\'equation indetermin\'ee du premier degr\'e qui n'admet que des solutions enti\`eres, J. Math. Pures Appl. (1) \textbf{6} (1841), 449--494.
- [Bi2]
- J. Binet, Note sur le nombre des divisions \`a effectuer pour obtenir le plus grand diviseur commun de deux nombres entiers\,\RM ; suivie d'une remarque sur une classe de s\'eries r\'ecurrentes, Comptes Rendus \textbf{19} (1844), 937--941.
- [C]
- G. Collins, \emph{Factoring univariate integral polynomials in polynomial average time}, Springer, New York, 1969 pp.~317--329.
- [CZ]
- D. Cantor and H. Zassenhaus, A new algorithm for factoring polynomials over finite fields, Math. Comp. \textbf{36} (1981), 587--592.
- [JT]
- M. A. Jenkins and J. F. Traub, A three-stage variable shift iteration for polynomial zeroes and its relation to generalized Rayleigh iteration, Numer. Math. \textbf{14} (1970), 252--263.
- [K]
- D. E. Knuth, \emph{The art of computer programming}, Addison-Wesley, Reading, MA, 1981.
- [L]
- G. Lam\'e, Note sur la limite du nombre des divisions dans la recherche du plus grand diviseur entre deux nombres entiers, Comptes Rendus \textbf{19} (1844), 867--870.
- [LLL]
- A. K. Lenstra, H. W. Lenstra, and L. Lov\'asz, Factoring polynomials with rational coefficients, Math. Ann. \textbf{261} (1982), 515--534.
- [M]
- M. Mignotte, An inequality about factors of polynomials, Math. Comp. \textbf{28} (1974), 1153--1157.
- [P]
- C. Pomerance, \emph{Analysis and comparison of some integer factoring algorithms}, Math. Centre Tracts 154/155, Math. Centrum, Amsterdam, 1982.
- [Z1]
- H. Zassenhaus, On Hensel factorization. {\rm I}, J. Number Theory \textbf{1} (1969), 291--311.
- [Z2]
- H. Zassenhaus, A remark on the Hensel factorization method, Math. Comp. \textbf{32} (1978), 287--292.
Additional Information:
Reviewer(s):
Hale
Trotter
Review Information:
Journal:
Bull. Amer. Math. Soc.
31
(1994),
312-318.
DOI:
10.1090/S0273-0979-1994-00542-7
PII:
S 0273-0979(1994)00542-7
|
Comments: webmaster@ams.org