85 search results - page 5 / 17 » stoc 2009 |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
89
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...