107 search results - page 3 / 22 » A Lower Bound for the Bounded Round Quantum Communication Co... |
ICALP
2003
Springer
13 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
COCO
2003
Springer
13 years 11 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...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
TAMC
2007
Springer
13 years 12 months ago
2007
Springer
APPROX
2009
Springer
14 years 11 days ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...