research
∙
09/14/2023
On Annihilators of Explicit Polynomial Maps
We study the algebraic complexity of annihilators of polynomials maps. I...
share
research
∙
02/26/2022
Transparency Beyond VNP in the Monotone Setting
Recently Hrubes and Yehudayoff (2021) showed a connection between the mo...
research
∙
01/17/2022
On Finer Separations between Subclasses of Read-once Oblivious ABPs
Read-once Oblivious Algebraic Branching Programs (ROABPs) compute polyno...
research
∙
12/13/2020
If VNP is hard, then so are equations for it
Assuming that the Permanent polynomial requires algebraic circuits of ex...
research
∙
04/29/2020
On the Existence of Algebraically Natural Proofs
For every constant c > 0, we show that there is a family {P_N, c} of pol...
research
∙
07/17/2018
Near-optimal Bootstrapping of Hitting Sets for Algebraic Models
The classical lemma of Ore-DeMillo-Lipton-Schwartz-Zippel [Ore22,DL78,Zi...
research
∙
07/17/2018
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits
The classical lemma of Ore-DeMillo-Lipton-Schwartz-Zippel states that an...
research
∙
09/10/2017