We prove two results about randomised query complexity R(f).
First, we i...
We exhibit an unambiguous k-DNF formula that requires CNF width
Ω̃(k^2),...
We investigate query-to-communication lifting theorems for models relate...
Based on the recent breakthrough of Huang (2019), we show that for any t...
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
Suppose we have randomized decision trees for an outer function f and an...
Based on the recent breakthrough of Huang (2019), we show that for any t...
We prove two new results about the randomized query complexity of compos...
The celebrated minimax principle of Yao (1977) says that for any
Boolean...
Suppose a Boolean function f is symmetric under a group action G acting
...
We define a new query measure we call quantum distinguishing complexity,...
We prove lower bounds on complexity measures, such as the approximate de...