A Generalized Class of Polynomials that are Hard to Factor

DOI10.1137/0212031zbMath0529.68018OpenAlexW1985210406MaRDI QIDQ3311656

B. David Saunders, Erich L. Kaltofen, David R. Musser

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0212031

zbMATH Keywords

Galois groupspolynomial factorizationcomputer algebraexponential timeBerlekamp-Hensel algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Cyclotomic extensions (11R18)

Related Items

Irreducibility of multivariate polynomials, Certifying Irreducibility in $${\mathbb Z}[x$$], Computer algebra: Past and future, Univariate polynomial factorization over finite fields, Fast computation of special resultants, A heuristic irreducibility test for univariate polynomials, Integer polynomials with roots mod \(p\) for all primes \(p\)