26 search results - page 4 / 6 » Superpolynomial Lower Bounds for Monotone Span Programs |
ECCC
2011
13 years 2 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
MFCS
2009
Springer
14 years 7 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
ICALP
2001
Springer
14 years 4 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...