
On the Probabilistic Degree of an nvariate Boolean Function
Nisan and Szegedy (CC 1994) showed that any Boolean function f:{0,1}^n→{...
read it

On the Probabilistic Degrees of Symmetric Boolean functions
The probabilistic degree of a Boolean function f:{0,1}^n→{0,1} is define...
read it

Decoding Downset codes over a finite grid
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a d...
read it

A FixedDepth SizeHierarchy Theorem for AC^0[⊕] via the Coin Problem
We prove the first Fixeddepth Sizehierarchy Theorem for uniform AC^0[⊕...
read it

The Coin Problem in Constant Depth: Sample Complexity and Parity Gates
The δCoin Problem is the computational problem of distinguishing betwee...
read it
S. Venkitesh
is this you? claim profile