Factoring polynomials modulo special primes

DOI10.1007/BF02124680zbMath0694.68039MaRDI QIDQ909466

Lajos Rónyai

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

complexitypolynomials over finite fieldsalgorithms of factoring polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (13)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Optimal strong primes ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ Univariate polynomial factorization over finite fields ⋮ Smoothness and factoring polynomials over finite fields ⋮ Factoring polynomials over special finite fields ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Factoring polynomials over finite fields: A survey ⋮ On the deterministic complexity of factoring polynomials ⋮ Searching for Primitive Roots in Finite Fields ⋮ Deterministic polynomial factoring and association schemes ⋮ Unnamed Item ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials and primitive elements for special primes
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• On the Efficiency of Algorithms for Polynomial Factoring
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: Factoring polynomials modulo special primes