Relations between the decision tree complexity and various other complex...
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
We study the communication complexity of computing functions
F:{0,1}^n×{...
Suppose a Boolean function f is symmetric under a group action G acting
...
share