172 search results - page 3 / 35 » The Complexity of Unions of Disjoint Sets |
COCO
2003
Springer
14 years 27 days 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 ...
JCT
2002
13 years 7 months ago
2002
In [2] a construction of a class of two-intersection sets with respect to hyperplanes in PG(r - 1, qt ), rt even, is given, with the same parameters as the union of (qt/2 - 1)/(q ...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...