Students should consult this page at least once a week for important information.
Lectures: Wednesday 2:10-4pm
Instructor: Toniann Pitassi
Office Hours: by appointment
LINKS TO BOOKS, BOOK CHAPTERS, LECTURE NOTES
PROBLEM SET
COURSE PRESENTATION
Information on your course presentation and accompanying lecture notes,
including suggestions for topics.
COURSE SLIDES AND LECTURE NOTES
Jan 19: Intro to Communication Complexity, Communication Complexity Models and Classes, Important
2-party functions.
Jan 26: Deterministic Communication, Combinatorical Characterization, Lower Bounds.
Feb 2: Logrank Conjecture
Feb 9: Randomized Communication, Discrepancy
Feb 16: Applications: Time/Space tradeoffs, game theory, streaming, property testing.
Feb 23: Applications: Circuit Complexity lower bounds via Lifting, Part I.
Mar 2: Circuit Complexity lower bounds via Lifting, Part II.
Decision tree lower bounds for CNF search problems, Deterministic Lifting Theorem via Sunflowers.
Mar 9: Partition number versus CC, Clique versus Independent set and applications
(Alon-Seymour-Saks graph theory conjecture, and Learning Partial Functions)
Mar 28: Information Complexity Part I (Dean Hirsch and Oliver Korten)
Apr 6: Information Complexity Part II (Alexander Lindenbaum and Yunya Zhao)
Apr 13: Extension Complexity (Chengyue He)
Apr 20: Log Rank Conjecture (Yuhao Li)
Apr 20, 27: NOF Communication Complexity (Dan Mitropolsky)
Apr 27: A Communication Model of Learning (Matthew Lawlon)
Online lecture: Lower Bounds for Gap Hamming (Tsung-Ju Chiang)
Video link: https://drive.google.com/file/d/1ASDezgEfuS4_9gbeeA2pw21Igcomg_Cy/view?usp=sharing
Template for lecture notes for your presentation.
Although not required, I recommend the following two textbooks on Communication Complexity.
The first one is a classic text called ``Communication Complexity'' by Nisan
The second one is a relatively new book ``Communication Complexity and Applications''
by Rao and Yehudayoff.
The following additional lecture notes and manuscripts are available
online and are also highly recommended.
LINKS TO PAPERS