On the deterministic complexity of factoring polynomials

DOI10.1006/jsco.1999.1001zbMath0972.11113OpenAlexW2027160923MaRDI QIDQ5928878

Shuhong Gao

Publication date: 13 November 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2873bbbac8f9ba31fa81b8d74cedf797692f437e

zbMATH Keywords

finite fieldsdeterministic polynomial time algorithmsextended Riemann hypothesisfactorization of polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (9)

Deterministic root finding over finite fields using Graeffe transforms ⋮ Counting roots for polynomials modulo prime powers ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Factoring polynomials over finite fields: A survey ⋮ Deterministic polynomial factoring and association schemes ⋮ Unnamed Item ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x\)] ⋮ A Generalised Successive Resultants Algorithm

Cites Work

• Factoring polynomials modulo special primes
• Factoring polynomials and primitive elements for special primes
• Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings
• Computing Frobenius maps and factoring polynomials
• On Hensel factorization. I
• Generalized riemann hypothesis and factoring polynomials over finite fields
• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• Factoring polynomials over finite fields
• Galois Groups and Factoring Polynomials over Finite Fields
• On the Efficiency of Algorithms for Polynomial Factoring
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Comments on search procedures for primitive roots
• Subquadratic-time factoring of polynomials over finite fields
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over special finite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the deterministic complexity of factoring polynomials