A comparison of two lower-bound methods for communication complexity
نویسندگان
چکیده
منابع مشابه
Some notes on two lower bound methods for communication complexity
We compare two methods for proving lower bounds on standard two-party model of communication complexity, the Rank method and Fooling set method. We present bounds on the number of functions f(x, y), x, y ∈ {0, 1}n, with rank of size k and fooling set of size at least k, k ∈ [1, 2n]. Using these bounds we give a novel proof that almost all Boolean functions f are hard, i.e., the communication co...
متن کاملDistributed Stochastic Variance Reduced Gradient Methods and A Lower Bound for Communication Complexity
We study distributed optimization algorithms for minimizing the average of convex functions. The applications include empirical risk minimization problems in statistical machine learning where the datasets are large and have to be stored on different machines. We design a distributed stochastic variance reduced gradient algorithm that, under certain conditions on the condition number, simultane...
متن کاملOn the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
This paper studies the three known lower bound methods for one-way quantum communication complexity, namely the Partition Tree method by Nayak, the Trace Distance method by Aaronson, and the two-way quantum communication complexity. It is shown that all these three methods can be exponentially weak for some total Boolean functions. In particular, for a large class of functions generated from Er...
متن کاملLower bound for communication complexity with no public randomness
We give a self contained proof of a logarithmic lower bound on the communication complexity of any non redundant function, given that there is no access to shared randomness. This bound was first stated in Yao’s seminal paper [STOC 1979], but no full proof appears in the literature. Our proof uses the method of Babai and Kimmel [Computational Complexity 1997], introduced there in the context of...
متن کاملA Lower Bound on Entanglement-Assisted Quantum Communication Complexity
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00062-x