On randomized one-round communication complexity
On randomized one-round communication complexity
复制标题
DOI：
10.1007/s000370050018
复制
发表时间：
1999-01-01
影响因子：
1.4
通讯作者：
Ron, D
中科院分区：
文献类型：
--
作者：
Kremer, I;Nisan, N;Ron, D
我们提出了几个结果随机一轮通信的复杂性。我们的研究结果包括VC维的连接，计算两个真实的值向量的内积的问题的研究，以及“同时”协议和单轮协议之间的关系。
We present several results regarding randomized one-round communication complexity. Our results include a connection to the VC-dimension, a study of the problem of computing the inner product of two real valued vectors, and a relation between "simultaneous" protocols and one-round protocols.