Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach

Zeyu Guo

Type: Preprint

Publication Date: 2020-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2007.00512

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach.	2020	Zeyu Guo
+	Deterministic polynomial factoring over finite fields: A uniform approach via <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">P</mml:mi></mml:math>-schemes	2019	Zeyu Guo
+	P-schemes and Deterministic Polynomial Factoring Over Finite Fields	2017	Zeyu Guo
+	Schemes for Deterministic Polynomial Factoring.	2008	Gábor Ivanyos Marek Karpiński Nitin Saxena
+ PDF Chat	Schemes for deterministic polynomial factoring	2009	Gábor Ivanyos Marek Karpiński Nitin Saxena
+ PDF Chat	Deterministic polynomial factoring and association schemes	2014	Manuel Arora Gábor Ivanyos Marek Karpiński Nitin Saxena
+	$\mathcal{P}$-schemes and Deterministic Polynomial Factoring over Finite Fields	2017	Zeyu Guo
+	Trading GRH for algebra: algorithms for factoring polynomials and related structures	2008	Gábor Ivanyos Marek Karpiński Lajos Rónyai Nitin Saxena
+	Schemes for Deterministic Polynomial Factoring	2008	Gábor Ivanyos Marek Karpiński Nitin Saxena
+	Efficiently factoring polynomials modulo $p^4$	2019	Ashish Dwivedi Rajat Mittal Nitin Saxena
+	Efficiently factoring polynomials modulo $p^4$	2019	Ashish Dwivedi Rajat Mittal Nitin Saxena
+	Efficiently factoring polynomials modulo $p^4$.	2019	Ashish Dwivedi Rajat Mittal Nitin Saxena
+ PDF Chat	Efficiently Factoring Polynomials Modulo p4	2019	Ashish Dwivedi Rajat Mittal Nitin Saxena
+ PDF Chat	On the Hidden Shifted Power Problem	2012	Jean Bourgain Moubariz Z. Garaev Sergeĭ Konyagin Igor E. Shparlinski
+ PDF Chat	Efficiently factoring polynomials modulo p4	2020	Ashish Dwivedi Rajat Mittal Nitin Saxena
+	Abelian Varieties with Prescribed Embedding Degree	2008	David Mandell Freeman Peter Stevenhagen Marco Streng
+	On the Hidden Shifted Power Problem	2011	Jean Bourgain Moubariz Z. Garaev Sergeĭ Konyagin Igor E. Shparlinski
+	On the Hidden Shifted Power Problem	2011	Jean Bourgain Moubariz Z. Garaev Sergeĭ Konyagin Igor E. Shparlinski
+	Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields	2016	Zeyu Guo Anand Kumar Narayanan Chris Umans
+	Abelian Varieties with Prescribed Embedding Degree	2008	David Freeman Peter Stevenhagen Marco Streng

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (9)

Action	Title	Year	Authors
+	The Freiman–Ruzsa theorem over finite fields	2014	Chaim Even‐Zohar Shachar Lovett
+ PDF Chat	Frobenius maps of abelian varieties and finding roots of unity in finite fields	1990	Jonathan Pila
+	A statistical theorem of set addition	1994	Antal Balog Endre Szemer�di
+	Factoring polynomials and Grobner bases	2009	Yinhua Guan
+ PDF Chat	Deterministic polynomial factoring and association schemes	2014	Manuel Arora Gábor Ivanyos Marek Karpiński Nitin Saxena
+	On square-free decomposition algorithms	1976	David Y. Y. Yun
+	A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four	1998	W. T. Gowers
+ PDF Chat	Character sums and deterministic polynomial root finding in finite fields	2015	Jean Bourgain Sergeĭ Konyagin Igor E. Shparlinski
+	How long does it take to generate a group?	2003	Benjamin Klopsch Vsevolod F. Lev