Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis

DOI10.1007/BF01104107zbMath0779.11060OpenAlexW1964376177MaRDI QIDQ684958

Sergei Evdokimov

Publication date: 15 September 1993

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01104107

zbMATH Keywords

complexitygeneralized Riemann hypothesisfactorizationdeterministic algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)

Related Items (6)

Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields ⋮ Constructing nonresidues in finite fields and the extended Riemann hypothesis ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Searching for Primitive Roots in Finite Fields ⋮ Unnamed Item ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures

Cites Work

• Factoring polynomials with rational coefficients
• A bound for the least prime ideal in the Chebotarev density theorem
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis