Sciweavers

16 search results - page 4 / 4
» On the degree of symmetric functions on the Boolean cube
Sort
View
FOCS
2007
IEEE
13 years 9 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay