On the Efficiency of Algorithms for Polynomial Factoring
From MaRDI portal
Publication:4118736
DOI10.2307/2005794zbMath0348.65045OpenAlexW4252607708MaRDI QIDQ4118736
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/2005794
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Polynomials over finite fields (11T06)
Related Items
Computing Frobenius maps and factoring polynomials, Deterministic root finding over finite fields using Graeffe transforms, An Improved Multivariate Polynomial Factoring Algorithm, Factoring polynomials and primitive elements for special primes, Unnamed Item, Univariate polynomial factorization over finite fields, Factoring polynomials modulo special primes, On splitting sets in block designs and finding roots of polynomials, A New Algorithm for Factoring Polynomials Over Finite Fields, Factoring polynomials over finite fields: A survey, On the deterministic complexity of factoring polynomials, Another polynomial homomorphism, Deterministic irreducibility testing of polynomials over large finite fields, Trading GRH for algebra: Algorithms for factoring polynomials and related structures, Deterministic root finding in finite fields
Uses Software
