A Generalized Class of Polynomials that are Hard to Factor

DOI10.1137/0212031MaRDI QIDQ3311656zbMATH OpenOpenAlexFDO

Authors Erich L. Kaltofen, B. David Saunders, 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

Berlekamp-Hensel algorithmcomputer algebraexponential timeGalois groupspolynomial factorization

Mathematics Subject Classification ID

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

Cited in

(7)

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

This page was built for publication: A Generalized Class of Polynomials that are Hard to Factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3311656)