Sciweavers

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

27

FOCS
2003
IEEE

favoriteEmaildiscussreport

122views Theoretical Computer Science» more FOCS 2003»

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

14 years 4 months ago

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

Download www.comp.nus.edu.sg

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

Real-time Traffic

FOCS 2003 | Theoretical Computer Science |

claim paper

Related Content

» Lower Bounds on Quantum Multiparty Communication Complexity

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

» Unifying the Landscape of CellProbe Lower Bounds

» Quantum lower bound for the collision problem

» A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences

» Multiparty Communication Complexity of Disjointness

» Communication Complexity Lower Bounds by Polynomials

» Communication Complexity and Its Applications

» Prior Entanglement Message Compression and Privacy in Quantum Communication

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	FOCS
Authors	Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

Comments (0)