Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes

DOI10.1016/j.jsc.2019.02.011zbMath1426.11135OpenAlexW2917665861MaRDI QIDQ2000290

Zeyu Guo

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2019.02.011

zbMATH Keywords

finite fieldpermutation grouppolynomial factoringalgebraic combinatoricsdeterministic polynomial-time factoring algorithmprimitive Galois groups of superpolynomial order

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Algebraic number theory computations (11Y40) Polynomials, factorization in commutative rings (13P05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
• Factoring polynomials modulo special primes
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials and primitive elements for special primes
• Factoring polynomials with rational coefficients
• A polynomial bound for the orders of primitive solvable groups
• Smoothness and factoring polynomials over finite fields
• Minimal degree for a permutation representation of a classical group
• Bases for primitive permutation groups and a conjecture of Babai
• Computing Frobenius maps and factoring polynomials
• Schemes for deterministic polynomial factoring
• Trading GRH for algebra: Algorithms for factoring polynomials and related structures
• Fast Polynomial Factorization and Modular Composition
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
• Factoring Polynomials over Algebraic Number Fields
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Factoring polynomials over finite fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Algorithms in Algebraic Number Theory
• Galois Groups and Factoring Polynomials over Finite Fields
• Simple groups, permutation groups, and probability
• Subquadratic-time factoring of polynomials over finite fields
• The Minimal Base Size of Primitive Solvable Permutation Groups
• Deterministic polynomial factoring and association schemes
• Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
• Character sums and deterministic polynomial root finding in finite fields
• Factoring Polynomials Over Large Finite Fields
• Number fields
• On the deterministic complexity of factoring polynomials

This page was built for publication: Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes