Start date cannot be after end date.
Additive combinatorics through the lens of communication complexity
Presenter
- Toniann Pitassi
November 15, 2022
IAS
How difficult is it to certify that a random 3SAT formula is unsatisfiable?
Presenter
- Toniann Pitassi
April 6, 2021
IAS
Simplified Lifting Theorems in Communication Complexity via Sunflowers
Presenter
- Toniann Pitassi
October 6, 2020
IAS
Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers
Presenter
- Toniann Pitassi
March 2, 2020
IAS
A Brief Tour of Proof Complexity: Lower Bounds and Open Problems
Presenter
- Toniann Pitassi
March 19, 2019
IAS
Hardness Escalation and the Rank of Polynomial Threshold Proofs
Presenter
- Paul Beame
November 30, 2010
IAS
