58 search results - page 1 / 12 » On Rank vs. Communication Complexity |
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper concerns the open problem of Lov
COCO
2000
Springer
13 years 11 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
STOC
2009
ACM
14 years 8 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...
CC
2007
Springer
13 years 7 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...