New bounds for the garden-hose model
We show new results about the garden-hose model. Our main results include improved lower bounds based on non-deterministic communication complexity (leading to the previously unknown Theta(n) bounds for Inner Product mod 2 and Disjointness), as well as an O(n * log^3(n) upper bound for the Distribut...
Saved in:
Main Authors: | Klauck, Hartmut, Podder, Supartha |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/87671 http://hdl.handle.net/10220/46787 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
EXPLORING DIFFERENT MODELS OF QUERY COMPLEXITY AND COMMUNICATION COMPLEXITY
by: SUPARTHA PODDER
Published: (2016) -
The complexity of quantum disjointness
by: Klauck, Hartmut
Published: (2018) -
Correlation in hard distributions in communication complexity
by: Klauck, Hartmut, et al.
Published: (2018) -
The partition bound for classical communication complexity and query complexity
by: Jain, R., et al.
Published: (2013) -
Complex symmetric weighted composition operators on the Fock space in several variables
by: Hai, Pham Viet, et al.
Published: (2019)