29908 search results - page 1 / 5982 » On the complexity of communication complexity |
COMPLEXITY
2004
13 years 5 months ago
2004
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
COCO
2010
Springer
13 years 10 months ago
2010
Springer
COCO
2008
Springer
13 years 7 months ago
2008
Springer
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...