scientific article; zbMATH DE number 7559413

DOI10.4230/LIPICS.MFCS.2020.42MaRDI QIDQ5089209FDOQ5089209

Authors: Zeyu Guo 

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.00512

Title of this publication is not available (Why is that?)

zbMATH Keywords

derandomizationfinite fieldpermutation groupalgebraic combinatoricsadditive combinatoricspolynomial factoring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Additive combinatorics
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Title not available (Why is that?)
• Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
• Factoring Polynomials Over Large Finite Fields
• On the deterministic complexity of factoring polynomials over finite fields
• Title not available (Why is that?)
• Factoring polynomials and primitive elements for special primes
• Smoothness and factoring polynomials over finite fields
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Galois Groups and Factoring Polynomials over Finite Fields
• Title not available (Why is that?)
• Deterministic polynomial factoring and association schemes
• Title not available (Why is that?)
• On the deterministic complexity of factoring polynomials
• Factoring polynomials modulo special primes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• On sums of generating sets in \(\mathbb Z_2^n\)
• Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
• Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
• On the Bogolyubov-Ruzsa lemma
• Factoring polynomials over finite fields
• Title not available (Why is that?)
• Character sums and deterministic polynomial root finding in finite fields
• Schemes for deterministic polynomial factoring
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Extensibility of association schemes and GRH-based deterministic polynomial factoring

Cited In (2)

• Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach
• Constructing composition factors for a linear group in polynomial time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089209)