Theory of Computation (TOC) Seminar

Xiao Wang (MIT): Covert Security with Public Verifiability: Simpler, Faster, and Leaner
Friday, October 12, 2018 - 10:30am to 12:00pm
Suresh Venkatasubramanian: Towards a theory (or theories) of fairness in automated decision-making
Tuesday, October 2, 2018 - 4:00pm to 5:00pm


Sasha Razborov: Grand Challanges in Complexity Theory through the Lens of Proof Theory
Tuesday, September 25, 2018 - 4:00pm to 5:00pm

Abstract: Given our current inability to even formulate a coherent program towards
solving grand challenges in computational complexity (such as P vs. NP), it
becomes increasingly important to at least understand this state of affairs;

Costis Daskalakis: Improving Generative Adversarial Networks using Game Theory and Statistics
Tuesday, September 18, 2018 - 4:00pm to 5:00pm

Abstract: Generative Adversarial Networks (aka GANs) are a recently proposed approach for learning samplers of high-dimensional distributions with intricate structure, such as distributions over natural images, given samples from these distributions.

Urmila Mahadev: Classical Verification of Quantam Computation
Tuesday, October 23, 2018 - 4:00pm to 5:00pm

Abstract: We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation.

Dor Minzer: 2-to-2 Games is NP-hard
Wednesday, April 11, 2018 - 4:15pm to 5:15pm
Benny Applebaum: Exponentially-Hard gap-CSP and local PRG via Local Hardcore Functions
Tuesday, April 10, 2018 - 4:00pm to 5:00pm
Is it possible to approximate the value of a 3-CNF formula to within a small constant factor in sub-exponential time?
Ohad Shamir: Is Depth Needed for Deep Learning? Circuit Complexity in Neural Networks
Tuesday, March 20, 2018 - 4:15pm to 5:15pm
Amnon Ta-Shma: Parity samplers and explicit, epsilon-Balanced codes close to the GV Bound
Tuesday, February 13, 2018 - 4:00pm to 5:00pm


Asaf Shapira: Efficient graph property testing
Tuesday, February 6, 2018 - 4:00pm to 5:00pm

Abstract: Results from around 10 years ago more or less determined which graph properties can be tested with a constant number of queries. However, in most cases the “constants” involves were enormous.


Subscribe to Theory of Computation (TOC) Seminar