135
Voted
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
98
Voted
COCO
2010
Springer
15 years 8 months ago
2010
Springer
118
Voted
COCO
2010
Springer
15 years 8 months ago
2010
Springer
138
Voted
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
144
Voted
COCO
2010
Springer
15 years 8 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...