Communication complexity in a 3-computer model
暂无分享,去创建一个
It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).
[1] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .