The Online Complexity Seminar consists of informal talks dedicated to topics of interest in computational complexity theory and related areas. Our goal is for these meetings to serve as a forum for discussions and quick dissemination of results. Meetings will not be recorded and anyone interested in complexity theory is welcome to join.
You can join the mailing list for talk announcements and keep track of them using this calendar. Please contact Igor Oliveira if you have any questions.
Previous Editions: 2020-21 - 2022-23. You can access the complete list of meetings through this website.
Zoom Link
(Meeting ID: 81446570030 | Passcode: 595431)
Upcoming Talks
14/November/2024 - 5pm London time
Speaker: Ted Pyne (MIT)
Title: Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness
(Joint work with Jiatu Li and Roei Tell)
12/December/2024 - 5pm London time
Speaker: Jingxun Liang (CMU)
Title: Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin
(Joint work with Lijie Chen and Jiatu Li)