29908 search results - page 358 / 5982 » On the Complexity of |
172
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
161
Voted
SSS
2009
Springer
15 years 11 months ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
178
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
170
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
181
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...