Repository Name
The Simons Institute for the Theory of Computing
Institution Short Name
Simons Institute
Institution Name
The Simons Institute for the Theory of Computing
Talks from Simons Institute
| Title | Speaker(s) | Date | Series/Collection | Type | Info |
|---|---|---|---|---|---|
| Syntax-Guided Program Synthesis | 2021‑02‑22 | View details | |||
| Rational Synthesis | 2021‑02‑19 | View details | |||
| On the Usefulness of the Strong Exponential Time Hypothesis | 2021‑02‑18 | View details | |||
| Total Function Problems in the Polynomial Hierarchy | 2021‑02‑18 | View details | |||
| Structure of SAT Instances | 2021‑02‑17 | View details | |||
| Combining SAT and Computer Algebra for Circuit Verification | 2021‑02‑16 | View details | |||
| Hypotheses about Satisfiability and their Consequences | 2021‑02‑11 | View details | |||
| Existentially Polytime Theorems | 2021‑02‑11 | View details | |||
| Theoretical Foundation of Solvers: Context, Directions and Open Problems | 2021‑02‑10 | View details | |||
| The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT | 2021‑02‑09 | View details | |||
| Reactive Synthesis | 2021‑02‑08 | View details | |||
| Using SAT Solvers to Prevent Causal Failures in the Cloud | 2021‑02‑05 | View details |