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.

 

On a new factorization algorithm for polynomials over finite fields
HTML articles powered by AMS MathViewer

by Harald Niederreiter and Rainer Göttfert PDF
Math. Comp. 64 (1995), 347-353 Request permission

Abstract:

A new deterministic factorization algorithm for polynomials over finite fields was recently developed by the first author. The bottleneck in this algorithm is the last stage in which the irreducible factors of the polynomial are derived from the solutions of a system of linear equations. An efficient approach to the last stage was designed by the second author for the case of finite fields of characteristic 2. In this paper, we describe a different approach to the last stage which works for arbitrary fields of positive characteristic. In particular, we obtain in this way an acceleration of the factorization algorithm of the first author which makes this algorithm polynomial time for fixed characteristic.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11T06, 11Y16
  • Retrieve articles in all journals with MSC: 11T06, 11Y16
Additional Information
  • © Copyright 1995 American Mathematical Society
  • Journal: Math. Comp. 64 (1995), 347-353
  • MSC: Primary 11T06; Secondary 11Y16
  • DOI: https://doi.org/10.1090/S0025-5718-1995-1265019-6
  • MathSciNet review: 1265019