166 search results - page 1 / 34 » Learning Complexity vs. Communication Complexity |
COCO
2008
Springer
15 years 2 months ago
2008
Springer
116
Voted
STOC
2009
ACM
16 years 1 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...
100
Voted
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
This paper concerns the open problem of Lov
145
click to vote
COCO
2000
Springer
15 years 4 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 ...
PIMRC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...