Overview
Syllabus
Intro
Motivation and Spoiler
Constraint Satisfaction Problem (CSP)
CSP in the Streaming Model
Trivial Random Sampling is Optimal for Max-CUT!
Max-DICUT in the Streaming Model
Warm-up: 2/5-Approximation by [GW17]
New Idea: Random Sampling with Bias
New Relation Between Total Bias and Cut Value
Streaming Lower Bounds via Communication Complexity
Distributional Boolean Hidden Partition (DBHP) Problem contains exactly
Example of DBHP (with Parallel Repetition)
Reducing DBHP to Max-DICUT (Max-2AND)
Conclusion
Future Directions
Taught by
IEEE FOCS: Foundations of Computer Science