Theory of Computation (TOC) Seminar
 |
Li-yang Tan: Properly learning decision trees in almost polynomial time Tuesday, October 19, 2021 - 4:00pm to 5:00pm Abstract |
 |
Nutan Limaye: Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits Tuesday, October 12, 2021 - 4:00pm to 5:00pm ABSTRACT: Every multivariate polynomial P(X) can be written as a sum
of monomials, i.e. a sum of products of variables and field constants. |
 |
Kuikui Liu: Markov Chain Analysis via Spectral Independence Tuesday, September 28, 2021 - 4:00pm to 5:00pm
|
 |
Nike Sun: Phase transitions in random constraint satisfaction problems Tuesday, December 8, 2020 - 4:00pm to 5:00pm Abstract: I will survey recent progress in determination of asymptotic behavior for random constraint satisfaction problems, including phase transitions and some understanding of solution geometry. |
 |
Toniann Pitassi: Lifting with Sunflowers Tuesday, December 1, 2020 - 4:00pm to 5:30pm Abstract: In this talk I will first motivate lifting theorems where lower bounds on communication complexity for composed functions are obtained by a general simulation theorem, essentially showing that no protoco |
 |
Huijia (Rachel) Lin: Indistinguishability Obfuscation from Well-Founded Assumptions Tuesday, November 17, 2020 - 4:00pm to 5:00pm
|
 |
Ashish Goel: Beyond Voting: Mechanisms and Platforms for Societal Decision Making Tuesday, November 10, 2020 - 4:00pm to 5:00pm Abstract: YouTube competes with Hollywood as an entertainment channel, and also supplements Hollywood by acting as a distribution mechanism. Twitter has a similar relationship to news media, and Coursera to |
 |
Nathan Klein: A (Slightly) Improved Approximation Algorithm for Metric TSP Tuesday, October 27, 2020 - 4:00pm to 5:15pm |
 |
James Aspnes: Population Protocols Tuesday, October 20, 2020 - 4:00pm to 5:00pm Abstract: |
 |
Alexandr Andoni: Approximating Edit Distance in Near-Linear Time Tuesday, October 13, 2020 - 4:00pm to 5:00pm Abstract: |
Pages
