activity
20162022
most citedAlgebraic dependencies and PSPACE algorithms in approximative complexity

2 citations · 4 across the 3 of their papers we have counts for

collaborators

7 papers

cs.DS20222 cited

Fast Multivariate Multipoint Evaluation Over All Finite Fields

Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo +2

Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work…

cs.CC2020

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…

math.NT2020

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

Zeyu Guo

Let be a degree- polynomial such that factorizes into distinct linear factors over . We study the pr…

cs.CC2019

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…

cs.CC20182 cited

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…

cs.CC2017

-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…