Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

A remark on the Hensel factorization method
HTML articles powered by AMS MathViewer

by Hans Zassenhaus PDF
Math. Comp. 32 (1978), 287-292 Request permission

Abstract:

In response to a remark of David Yun a new version of "On Hensel factorization I" (J. Number Theory, v. 1, 1969) is given which sets in evidence the quadratic convergence behavior of the method using a minimum of bookkeeping.
References
    A. MIOLA & D. Y. Y. YUN, The Computational Aspects of Hensel-Type Univariate Polynomial Greatest Common Divisor Algorithms, Proc. Eurosam 1974 (ACM SIGSAM Bull. No. 31), Stockholm, Sweden, August 1974, pp. 46-54. DAVID Y. Y. YUN, Hensel Meets Newton-Algebraic Constructions in an Analytic Setting, RC 5538 IBM Research, July 1975, 11pp.
  • Hans Zassenhaus, On Hensel factorization. I, J. Number Theory 1 (1969), 291–311. MR 242793, DOI 10.1016/0022-314X(69)90047-X
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 12A20
  • Retrieve articles in all journals with MSC: 12A20
Additional Information
  • © Copyright 1978 American Mathematical Society
  • Journal: Math. Comp. 32 (1978), 287-292
  • MSC: Primary 12A20
  • DOI: https://doi.org/10.1090/S0025-5718-1978-0476692-4
  • MathSciNet review: 0476692