Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

Details 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

2009-08-31

arxiv.org/abs/0908.4453v1

Computer Science

Computational Complexity

5 pages

Scientific paper

We show lower bounds of $\Omega(\sqrt{n})$ and $\Omega(n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$-variable read-once Boolean formulas. Our results complement the recent lower bound of $\Omega(n/8^d)$ by Leonardos and Saks and $\Omega(n/2^{\Omega(d\log d)})$ by Jayram, Kopparty and Raghavendra for randomized communication complexity of read-once Boolean formulas with depth $d$. We obtain our result by "embedding" either the Disjointness problem or its complement in any given read-once Boolean formula.

Affiliated with

Also associated with

No associations

Rating

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220256