Completed
Proof Strategy (Classical lower bounds)
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Communication Complexity of Private Simultaneous Messages Protocols - 2021 ITC Conference
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Multi-Party Computation (MPC)
- 3 Communication Cost of MPC
- 4 Models for Communication Complexity
- 5 Some Results on PSM protocols
- 6 Communication Complexity in SMP Randomness vs Entanglement
- 7 Our Results (1)
- 8 Proof Strategy (Classical lower bounds)
- 9 Proof Strategy (Quantum lower bounds)
- 10 Concluding Remarks
