Sciweavers

COCO
2008
Springer
108views Algorithms» more  COCO 2008»
13 years 6 months ago
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
Dmitry Gavinsky, Pavel Pudlák