Unlocking Complexity: Proofs, Circuits, and Communication Lower Bounds 🧩
Join Robert Robere's seminar to explore groundbreaking insights into proofs, circuit complexity, communication protocols, and the fundamental limits in computational complexity theory.
Institute for Advanced Study
1.2K views • Feb 11, 2020
About this video
Computer Science/Discrete Mathematics Seminar II
Topic: Proofs, Circuits, Communication, and Lower Bounds in Complexity Theory
Speaker: Robert Robere
Affiliation: Member, School of Mathematics
Date: February 11, 2020
For more video please visit http://video.ias.edu
Topic: Proofs, Circuits, Communication, and Lower Bounds in Complexity Theory
Speaker: Robert Robere
Affiliation: Member, School of Mathematics
Date: February 11, 2020
For more video please visit http://video.ias.edu
Video Information
Views
1.2K
Likes
23
Duration
01:59:01
Published
Feb 11, 2020
User Reviews
4.5
(1)