Depth-independent lower bounds on the communication complexity of read-once Boolean formulas

Depth-independent lower bounds on the communication complexity of read-once Boolean formulas

10.1007/978-3-642-14031-0_8

Saved in:
Bibliographic Details
Main Authors: Jain, R., Klauck, H., Zhang, S.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Online Access:http://scholarbank.nus.edu.sg/handle/10635/41159
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
Description
Summary:10.1007/978-3-642-14031-0_8

Similar Items