scientific article; zbMATH DE number 7559413
From MaRDI portal
Publication:5089209
DOI10.4230/LIPIcs.MFCS.2020.42MaRDI QIDQ5089209
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2007.00512
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite fieldpermutation groupderandomizationpolynomial factoringadditive combinatoricsalgebraic combinatorics
Cites Work
- 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
- Smoothness and factoring polynomials over finite fields
- On the Bogolyubov-Ruzsa lemma
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Schemes for deterministic polynomial factoring
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures
- On Sums of Generating Sets in ℤ2n
- Generalized riemann hypothesis and factoring polynomials over finite fields
- Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Factoring polynomials over finite fields
- Galois Groups and Factoring Polynomials over Finite Fields
- 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
- On the deterministic complexity of factoring polynomials
This page was built for publication:
