Optimal direct sum results for deterministic and randomized decision tree complexity
10.1016/j.ipl.2010.07.020
Saved in:
Main Authors: | Jain, R., Klauck, H., Santha, M. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/43106 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
New results in the simultaneous message passing model via information theoretic techniques
by: Jain, R., et al.
Published: (2013) -
A composition theorem for randomized query complexity
by: Anshu, Anurag, et al.
Published: (2018) -
The Communication complexity of correlation
by: Harsha, P., et al.
Published: (2013) -
Query complexity of matroids
by: Kulkarni, R., et al.
Published: (2014) -
The partition bound for classical communication complexity and query complexity
by: Jain, R., et al.
Published: (2013)