搜索结果: 1-1 共查到“格论 Communication Complexity”相关记录1条 . 查询时间(0.138 秒)
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Optimal Lower Bound Communication Complexity Gap-Hamming-Distance
2010/12/15
We prove an optimal W(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal multi-pass space lower...