Theory of Computation (TOC) Seminar

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.

Barna Saha: Space & Time Efficient Algorithms for "Bounded Difference" Problems
Tuesday, December 12, 2017 - 4:00pm to 5:00pm
Pravesh Kothari: Outlier-Robust Moment Estimation via Sum-of-Squares
Tuesday, December 5, 2017 - 4:00pm to 5:00pm


Kasper Green Larsen: Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
Tuesday, November 28, 2017 - 4:00pm to 5:00pm
Venkatesan Guruswami: Promise Constraint Satisfaction
Tuesday, November 14, 2017 - 4:00pm to 5:00pm

Abstract:  Given a 5-SAT instance admitting an assignment satisfying at least 2 literals in each clause, can one efficiently find a satisfying assignment that sets at least one literal to true in each clause?

Omer Paneth: On the round Complexity of Zero-Knowledge Protocols and Compressing Collisions
Tuesday, November 7, 2017 - 4:00pm to 5:00pm


Subscribe to Theory of Computation (TOC) Seminar