research
∙
07/07/2021
On the Probabilistic Degree of an n-variate Boolean Function
Nisan and Szegedy (CC 1994) showed that any Boolean function f:{0,1}^n→{...
share
research
∙
10/06/2019
On the Probabilistic Degrees of Symmetric Boolean functions
The probabilistic degree of a Boolean function f:{0,1}^n→{0,1} is define...
research
∙
08/20/2019
Decoding Downset codes over a finite grid
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a d...
research
∙
09/11/2018
A Fixed-Depth Size-Hierarchy Theorem for AC^0[⊕] via the Coin Problem
We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC^0[⊕...
research
∙
09/11/2018
