45 search results - page 1 / 9 » The Intersection Theorem for Direct Products |
66
Voted
EJC
1998
15 years 14 hour ago
1998
COMBINATORICS
2007
15 years 10 days ago
2007
Let Sn denote the symmetric group on [n] = {1, . . . , n}. A family I ⊆ Sn is intersecting if any two elements of I have at least one common entry. It is known that the only int...
115
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
121
click to vote
COCO
2008
Springer
15 years 2 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
130
click to vote
TOC
2010
14 years 7 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...