Sciweavers

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

102

Voted

COCO
2010
Springer

146views Algorithms» more COCO 2010»

The Partition Bound for Classical Communication Complexity and Query Complexity

15 years 6 months ago

The Partition Bound for Classical Communication Complexity and Query Complexity

Download www.comp.nus.edu.sg

Rahul Jain, Hartmut Klauck

Real-time Traffic

Algorithms | COCO 2010 |

claim paper

Related Content

» The Quantum Adversary Method and Classical Formula Size Lower Bounds

» New bounds on classical and quantum oneway communication complexity

» Towards the Classical Communication Complexity of Entanglement Distillation Protocols with...

» A new exponential separation between quantum and classical oneway communication complexity

» Exponential separation of quantum and classical oneway communication complexity

» Exponential Separation of Quantum and Classical Noninteractive Multiparty Communication Co...

» UnboundedError OneWay Classical and Quantum Communication Complexity

» Strong direct product theorems for quantum communication and query complexity

» Communication Complexity Lower Bounds by Polynomials

Post Info
More Details (n/a)

Added	15 Aug 2010
Updated	15 Aug 2010
Type	Conference
Year	2010
Where	COCO
Authors	Rahul Jain, Hartmut Klauck

Comments (0)