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...
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 ...
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 ...