On the Usefulness of the Strong Exponential Time Hypothesis

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


Duration: 1:06:55
1,913 views
38

Ryan Williams (MIT)
https://simons.berkeley.edu/talks/tbd-270
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing



Other Videos By Simons Institute for the Theory of Computing


2021-03-01Data-Driven Inference of Representation Invariants
2021-03-01Neural Network guided Grammar Filtering For Syntax-Guided Synthesis
2021-02-26The Complexity of Computing a Tarski Fixed Point of a Monotone Function, With Applications to Games
2021-02-25Richard M. Karp Distinguished Lecture — Automated Formal Program Repair
2021-02-25Quantum Algorithmic Measurements | Quantum Colloquium
2021-02-25Encodings Showcase
2021-02-24Deep Dive into CDCL Pseudo-Boolean Solvers (focusing on the implementation in Sat4j)
2021-02-23Quantum Algorithms for Hamiltonian Simulation | Quantum Colloquium
2021-02-22Syntax-Guided Program Synthesis
2021-02-19Rational Synthesis
2021-02-18On the Usefulness of the Strong Exponential Time Hypothesis
2021-02-18Total Function Problems in the Polynomial Hierarchy
2021-02-17Combining SAT and Computer Algebra for Circuit Verification
2021-02-11Hypotheses about Satisfiability and their Consequences
2021-02-11Existentially Polytime Theorems
2021-02-09The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT
2021-02-09Quantum Supremacy via Boson Sampling: Theory and Practice | Quantum Colloquium
2021-02-08Reactive Synthesis
2021-02-06Using SAT Solvers to Prevent Causal Failures in the Cloud
2021-02-05Programming Z3
2021-02-05Approximate Counting and Sampling


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