COM SCI 285CC · CS 285CCCommunication Complexity
Computer Science · 4 units · Graduate courses (200-299)
Limited to graduate students. Mathematical maturity strongly encouraged. Introduction to communication complexity with coverage of fundamentals, key classic theorems, and current research directions. Consider function f whose arguments are distributed among several parties, making it impossible for any one party to compute f in isolation. Communication complexity theory studies how many bits of communication are needed to evaluate f . Pioneered in 1979 by Turing award winner Andrew Yao, communication complexity has become central area of theoretical computer science with deep open questions, beautiful mathematics, and vast array of applications.
Letter grading.
When it runs
- Fall 2025
- Fall 2026
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
Requisites
UCLA lists no requisites for this course.
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Nothing — this is an entry point.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.