3000+ Courses from California Community Colleges

Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit

Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit

Ryan O'Donnell via YouTube Direct link

Alternative Proof

12 of 13
Previous
Next

12 of 13

Alternative Proof

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 Communication Protocol
  3. 3 Communication Matrix
  4. 4 Communication Problem
  5. 5 Partitioning
  6. 6 Hypothetical
  7. 7 Partitions
  8. 8 Communication Protocols
  9. 9 Combinatorial Rectangle
  10. 10 Mondrian Style
  11. 11 Theorem
  12. 12 Alternative Proof
  13. 13 Log rank conjecture

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.