76 search results - page 6 / 16 » On the Complexity of Matrix Rank and Rigidity |
COCO
2009
Springer
14 years 1 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
TWC
2010
13 years 2 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
COCO
2000
Springer
13 years 11 months ago
2000
Springer
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 ...
COCO
2001
Springer
13 years 12 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...