[Colloquium] [Staff] Theory Seminars at Computer Science

[Donna Brooms]

     *REMINDER*

COMPUTER SCIENCE

The University of Chicago

THEORY SEMINAR

_____________________

Date:		Tuesday, March 13, 2012

Time:		3 p.m.

Place:		Ryerson 251, 1100 E. 58th Street

_______________________

Speaker:	Eli Ben-Sasson

From:		Technion - Israel Institute of Technology

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

Abstract:        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

_________________________

*Refreshments will be served prior to the talk at 2:30 in Ryerson 255*

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20120313/a32c4604/attachment.htm