2 citations · 6 across the 5 of their papers we have counts for
5 papers · 1 filter
Efficient List-Decoding with Constant Alphabet and List Sizes
Zeyu Guo, Noga Ron-Zewi
We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for a…
Derandomization from Algebraic Hardness
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi +1
A hitting-set generator (HSG) is a polynomial map such that for all -variate polynomials of small enough circuit size and degree, if is…
Algebraic dependencies and PSPACE algorithms in approximative complexity
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Testing whether a set of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebra…
-schemes and Deterministic Polynomial Factoring over Finite Fields
Zeyu Guo
We introduce a family of mathematical objects called -schemes, where is a poset of subgroups of a finite group . A -scheme is a collectio…
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
Zeyu Guo, Anand Kumar Narayanan, Chris Umans
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm.…