54 search results - page 1 / 11 » Quantum Multiparty Communication Complexity and Circuit Lowe... |
108
Voted
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
153
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
119
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
124
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
113
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...