
An Optimal Separation of Randomized and Quantum Query Complexity
We prove that for every decision tree, the absolute values of the Fourie...
read it

Quantum Communication Complexity of Distribution Testing
The classical communication complexity of testing closeness of discrete ...
read it

VanishingError Approximate Degree and QMA Complexity
The ϵapproximate degree of a function f X →{0, 1} is the least degree o...
read it

The Hardest Halfspace
We study the approximation of halfspaces h:{0,1}^n→{0,1} in the infinity...
read it

NearOptimal Lower Bounds on the Threshold Degree and SignRank of AC^0
The threshold degree of a Boolean function f{0,1}^n→{0,1} is the minimum...
read it

Algorithmic Polynomials
The approximate degree of a Boolean function f(x_1,x_2,...,x_n) is the m...
read it

Inner Product and Set Disjointness: Beyond Logarithmically Many Parties
A basic goal in complexity theory is to understand the communication com...
read it
Alexander A. Sherstov
is this you? claim profile