Sciweavers

Share
FOCS
1998
IEEE

The Quantum Communication Complexity of Sampling

9 years 6 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1998
Where FOCS
Authors Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
Comments (0)
books