The partition bound for classical communication complexity and query complexity

The partition bound for classical communication complexity and query complexity

10.1109/CCC.2010.31

Saved in:
Bibliographic Details
Main Authors: Jain, R., Klauck, H.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Subjects:
Communication complexity
Linear programming
Lower bounds
Partition bound
Query complexity
Online Access:http://scholarbank.nus.edu.sg/handle/10635/40841
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/40841

Similar Items