Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
10.1007/978-3-642-14031-0_8
Saved in:
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 |
Similar Items
-
The partition bound for classical communication complexity and query complexity
by: Jain, R., et al.
Published: (2013) -
New bounds on classical and quantum one-way communication complexity
by: Jain, R., et al.
Published: (2013) -
Improved time complexities for learning boolean networks
by: Zheng, Yun., et al.
Published: (2014) -
A direct product theorem for the two-party bounded-round public-coin communication complexity
by: Jain, R., et al.
Published: (2013) -
Some formulas and bounds for the bandwidth of graphs
by: Lim, Yvette F.
Published: (1999)