A generalized class of polynomials that are hard to factor

Authors:
Erich Kaltofen;David R. Musser;B. David Saunders
Affiliations:
-;-;-
Venue:
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Year:
1981

Citing 4
Cited 3

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Multivariate Polynomial Factorization

Journal of the ACM (JACM)
Factoring univariate integral polynomial in polynomial average time

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
On the van der Waerden criterion for the group of an equation

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

Recovery of algebraic numbers from their p-adic approximations

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A comparison of the Vaxima and Reduce factorization packages

ACM SIGSAM Bulletin
Factorization of polynomials

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of univariate polynomials is defined which make the Berlekamp-Hensel factorization algorithm take an exponential amount of time. The class contains as subclasses the Swinnerton-Dyer polynomials discussed by Berlekamp and a subset of the cyclotomic polynomials. Aside from shedding light on the complexity of polynomial factorization this class is also useful in testing implementations of the Berlekamp-Hensel and related algorithms.