搜索结果: 1-2 共查到“数学 Communication Complexity”相关记录2条 . 查询时间(0.118 秒)
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
communication complexity streaming, matrix singularity determinant
2012/12/3
Finding the singularity of a matrix is a basic problem in linear algebra. Chu and Schnitger first considered this problem in the communication complexity model, in which Alice holds the first half of ...
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...