On the Efficiency of Algorithms for Polynomial Factoring

DOI10.2307/2005794MaRDI QIDQ4118736zbMATH OpenOpenAlexFDO

Authors R. Moenck

Publication date 1977

Full work available at URL https://doi.org/10.2307/2005794

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials over finite fields (11T06) Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(15)

• Factoring polynomials and primitive elements for special primes
• Univariate polynomial factorization over finite fields
• Another polynomial homomorphism
• Deterministic irreducibility testing of polynomials over large finite fields
• Computing Frobenius maps and factoring polynomials
• Deterministic root finding over finite fields using Graeffe transforms
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• scientific article; zbMATH DE number 3660789 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• An Improved Multivariate Polynomial Factoring Algorithm
• Deterministic root finding in finite fields
• Factoring polynomials over finite fields: A survey
• On the deterministic complexity of factoring polynomials
• Factoring polynomials modulo special primes
• On splitting sets in block designs and finding roots of polynomials

Describes a project that uses

Uses Software

• MACSYMA

This page was built for publication: On the Efficiency of Algorithms for Polynomial Factoring

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