Galois Groups and Factoring Polynomials over Finite Fields

DOI10.1137/0405026zbMath0825.68425OpenAlexW2016350785MaRDI QIDQ4018845

Lajos Rónyai

Publication date: 16 January 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405026

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (9)

Deterministic root finding over finite fields using Graeffe transforms ⋮ Univariate polynomial factorization over 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 ⋮ A Generalised Successive Resultants Algorithm

This page was built for publication: Galois Groups and Factoring Polynomials over Finite Fields