Generalized riemann hypothesis and factoring polynomials over finite fields

DOI10.1016/0196-6774(91)90014-PzbMath0731.11067OpenAlexW2090549251MaRDI QIDQ3356388

Ming-Deh A. Huang

Publication date: 1991

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90014-p

zbMATH Keywords

finite fieldgeneralized Riemann hypothesisfactorization of polynomialsdeterministic polynomial time algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Cyclotomy (11T22)

Related Items (10)

Deterministic root finding over finite fields using Graeffe transforms ⋮ Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields ⋮ Computational complexity of sentences over 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 ⋮ Deterministic polynomial factoring and association schemes ⋮ Unnamed Item ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures

This page was built for publication: Generalized riemann hypothesis and factoring polynomials over finite fields