Computational complexity
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=mrkViXk7XpM
7Total Functions in the Polynomial Hierarchy
Daniel Mitropolsky (Columbia University), Christos Papadimitriou (Columbia University), Robert Kleinberg (Cornell University)
The Complexity of Finding Fair Independent Sets in Cycles
Ishay Haviv (The Academic College of Tel Aviv-Yaffo)
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
Olaf Beyersdorff (University of Jena), Benjamin Böhm (University of Jena)
Complete Problems for Multi-Pseudodeterministic Computations
Peter Dixon (Iowa State University), A Pavan (Iowa State University), N. V. Vinodchandran (University of Nebraska-Lincoln)
Two combinatorial MA-complete problems
Dorit Aharonov (Hebrew University of Jerusalem), Alex B. Grilo (CWI and QuSoft)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 2021-01-12 | Codes and information |
| 2021-01-12 | Machine Learning |
| 2021-01-11 | Circuits and communication |
| 2021-01-10 | Graph algorithms |
| 2021-01-10 | Algorithms |
| 2021-01-10 | GRADUATING BITS |
| 2021-01-10 | Algorithmic game theory |
| 2021-01-10 | Quantum information |
| 2021-01-10 | Quantum |
| 2021-01-09 | Analytic methods |
| 2021-01-09 | Computational complexity |
| 2021-01-08 | Distributed models |
| 2021-01-08 | Pseudorandomness |
| 2021-01-08 | Crypto and Privacy |
| 2021-01-08 | Matchings |
| 2021-01-08 | Introductory Remarks |
| 2020-12-28 | David Harold Blackwell Summer Research Institute | Interview with Jelani Nelson |
| 2020-12-19 | Recent Developments in Supervised Learning With Noise |
| 2020-12-19 | Testing and Reconstruction via Decision Trees |
| 2020-12-18 | An Equivalence Between Private Classification and Online Prediction |
| 2020-12-18 | Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models |
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS 2021