Deterministic polynomial factoring over finite fields: a uniform approach via P-schemes
From MaRDI portal
Publication:2000290
Recommendations
- Deterministic distinct-degree factorization of polynomials over finite fields
- On the deterministic complexity of factoring polynomials over finite fields
- scientific article; zbMATH DE number 691482
- Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
- scientific article; zbMATH DE number 1273637
- Univariate polynomial factorization over finite fields
- Schemes for deterministic polynomial factoring
- scientific article; zbMATH DE number 1273636
- Factoring polynomials over finite fields: A survey
- Factoring polynomials over arbitrary finite fields
Cites work
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A polynomial bound for the orders of primitive solvable groups
- Algorithms in Algebraic Number Theory
- Bases for primitive permutation groups and a conjecture of Babai
- Character sums and deterministic polynomial root finding in finite fields
- Computing Frobenius maps and factoring polynomials
- Deterministic polynomial factoring and association schemes
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Extensibility of association schemes and GRH-based deterministic polynomial factoring
- Factoring polynomials and primitive elements for special primes
- Factoring polynomials modulo special primes
- Factoring Polynomials over Algebraic Number Fields
- Factoring polynomials over finite fields
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials with rational coefficients
- Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
- Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
- Fast polynomial factorization and modular composition
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Galois Groups and Factoring Polynomials over Finite Fields
- Generalized riemann hypothesis and factoring polynomials over finite fields
- scientific article; zbMATH DE number 1643928 (Why is no real title available?)
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 4055862 (Why is no real title available?)
- scientific article; zbMATH DE number 3785035 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 66617 (Why is no real title available?)
- scientific article; zbMATH DE number 1313469 (Why is no real title available?)
- scientific article; zbMATH DE number 799779 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 5485560 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Minimal degree for a permutation representation of a classical group
- Number fields
- On the deterministic complexity of factoring polynomials
- On the deterministic complexity of factoring polynomials over finite fields
- Schemes for deterministic polynomial factoring
- Simple groups, permutation groups, and probability
- Smoothness and factoring polynomials over finite fields
- Subquadratic-time factoring of polynomials over finite fields
- The Minimal Base Size of Primitive Solvable Permutation Groups
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
Cited in
(4)
This page was built for publication: Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000290)