131
Voted
COCO
15 years 7 months ago
2003 Springer 
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
109
click to vote
COCO
15 years 7 months ago
2003 Springer 
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
112
click to vote
COCO
15 years 7 months ago
2003 Springer
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
115
Voted
COCO
15 years 7 months ago
2003 Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
123
Voted
COCO
15 years 7 months ago
2003 Springer 
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
|
Algorithms