ARC Colloquium: Eli Ben-Sasson, Technion - Israel Institute of Technology

Event Details
  • Date/Time:
    • Monday March 12, 2012 - Tuesday March 13, 2012
      1:00 pm - 12:59 pm
  • Location: Klaus 1116, Georgia Tech, Atlanta, GA
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:


Summary Sentence: An Additive Combinatorics Approach to the Study of the Log-rank Conjecture in Communication Complexity

Full Summary: No summary paragraph submitted.


For a {0,1}-valued matrix M let CC(M) denote the deterministic communication complexity of the boolean function associated with M. The log-rank conjecture of Lovasz and Saks [FOCS 1988] states that CC(M) <= log^c(rank(M)) for some absolute constant c where rank(M) denotes the rank of M over the field of real numbers.

We show that CC(M) <= c rank(M)/ log rank(M) for some absolute constant c, assuming a well-known conjecture from additive combinatorics, known as the Polynomial Freiman-Ruzsa (PFR) conjecture.

Our proof is based on the study of the "approximate duality conjecture" which was recently suggested by Ben-Sasson and Zewi [STOC 2011], and studied there in connection to the PFR conjecture. First we improve the bounds on approximate duality assuming the PFR conjecture. Then we use the approximate duality conjecture (with improved bounds) to get the aforementioned upper bound on the communication complexity of low-rank martices, and this part uses the methodology suggested by Nisan and Wigderson [Combinatorica 1995].

Joint work with Shachar Lovett and Noga Zewi

Additional Information

In Campus Calendar

School of Computer Science, ARC

Invited Audience
No audiences were selected.
No keywords were submitted.
  • Created By: Elizabeth Ndongi
  • Workflow Status: Published
  • Created On: Jan 11, 2012 - 11:46am
  • Last Updated: Oct 7, 2016 - 9:57pm