
Unambiguous DNFs and AlonSaksSeymour
We exhibit an unambiguous kDNF formula that requires CNF width Ω̃(k^2),...
read it

On QuerytoCommunication Lifting for Adversary Bounds
We investigate querytocommunication lifting theorems for models relate...
read it

Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem
Based on the recent breakthrough of Huang (2019), we show that for any t...
read it

Symmetries, graph properties, and quantum speedups
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
read it

When Is Amplification Necessary for Composition in Randomized Query Complexity?
Suppose we have randomized decision trees for an outer function f and an...
read it

Quantum Implications of Huang's Sensitivity Theorem
Based on the recent breakthrough of Huang (2019), we show that for any t...
read it

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions
We prove two new results about the randomized query complexity of compos...
read it

A New Minimax Theorem for Randomized Algorithms
The celebrated minimax principle of Yao (1977) says that for any Boolean...
read it

How symmetric is too symmetric for large quantum speedups?
Suppose a Boolean function f is symmetric under a group action G acting ...
read it

Quantum distinguishing complexity, zeroerror algorithms, and statistical zero knowledge
We define a new query measure we call quantum distinguishing complexity,...
read it

Classical lower bounds from quantum upper bounds
We prove lower bounds on complexity measures, such as the approximate de...
read it
Shalev BenDavid
is this you? claim profile