Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

79

Voted

TAMC
2007
Springer

favoriteEmaildiscussreport

95views Applied Computing» more TAMC 2007»

Quantum Multiparty Communication Complexity and Circuit Lower Bounds

15 years 3 months ago

Quantum Multiparty Communication Complexity and Circuit Lower Bounds

Download www.lri.fr

Iordanis Kerenidis

Real-time Traffic

TAMC 2007 |

claim paper

Related Content

» Lower Bounds on Quantum Multiparty Communication Complexity

» Multiparty Quantum Communication Complexity with Routed Messages

» The Maximum Communication Complexity of MultiParty Pointer Jumping

» Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity

» Communication Complexity Lower Bounds by Polynomials

» Lower bounds for numberinhand multiparty communication complexity made easy

» NearOptimal Lower Bounds on the MultiParty Communication Complexity of Set Disjointness

» A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness

» Multiparty Communication Complexity of Disjointness

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	TAMC
Authors	Iordanis Kerenidis

Comments (0)