Sciweavers

Share
FOCS
2003
IEEE

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

9 years 4 months ago
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where FOCS
Authors Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Comments (0)
books