Where The Really Hard Problems Really Are?

Where The Really Hard Problems Really Are?

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Xs2QIUAzB4I


Duration: 59:45
945 views
31

Lenka Zdeborova (EPFL)
https://simons.berkeley.edu/talks/tbd-302
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing



Other Videos By Simons Institute for the Theory of Computing


2021-04-27Quantified Boolean Formulas
2021-04-27A Finite-Model-Theoretic View on Propositional Proof Complexity
2021-04-27Reasoning Systems from Descriptive Complexity
2021-04-27Past and Present of Descriptive Complexity Theory
2021-04-26Provably Correct Training of Neural Network Controllers
2021-04-26Coordination of for Large Collections of Dynamical Systems with Constraint Satisfaction Guarantees
2021-04-26Synthesis for Correctness Is Not Enough: How to Specify, Verify, and Synthesize Robust Systems
2021-04-26Optimization-based Formal Synthesis of Control Strategies for Dynamical Systems
2021-04-23Safe Human-Interactive Control via Shielding
2021-04-22Strict NP: Expressive Power, Structure, and Complexity
2021-04-22Where The Really Hard Problems Really Are?
2021-04-21An Automated Approach to the Collatz Conjecture
2021-04-21Symbolic Computation Techniques in SMT Solving: Mathematical Beauty Meets Efficient Heuristics
2021-04-21Computer Algebra and SAT for Mathematical Search
2021-04-21Panel Discussion on Postquantum Cryptography | Quantum Colloquium
2021-04-21Postquantum Cryptography | Quantum Colloquium
2021-04-20Step-Wise Explanations for Constraint Programs
2021-04-19Richard M. Karp Distinguished Lecture — How Difficult is it to Certify that a Random SAT Formula is
2021-04-16Distributed Computing Meets Game Theory: Fault Tolerance and Implementation with Cheap Talk
2021-04-15Complexity and Diversity
2021-04-15SAT and Foundations of Mathematics


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Lenka Zdeborova
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing