Elsevier

Journal of Algorithms

Volume 5, Issue 2, June 1984, Pages 180-186
Journal of Algorithms

Finding the number of factors of a polynomial

https://doi.org/10.1016/0196-6774(84)90025-7Get rights and content

Abstract

Because computing modulo small primes is so cheap there is a common hope that global properties of polynomials might be easily deduced from such computations. The number of factors can be found, assuming suitable Riemann hypotheses, but in many interesting cases it is not possible to find the Galois group.

References (6)

  • H Zassenhaus

    On Hensel factorization, I

    J. Number of Theory

    (1969)
  • E Berlekamp

    Factoring polynomials over large finite fields

    Math. Comp.

    (1970)
  • G Cooke et al.

    On the construction of division chains in algebraic number rings, with applications to SL2

    Comm. Algebra

    (1975)
There are more references available in the full text version of this article.

Cited by (18)

  • Knottedness is in NP, modulo GRH

    2014, Advances in Mathematics
  • Cook's versus Valiant's hypothesis

    2000, Theoretical Computer Science
View all citing articles on Scopus
View full text