A Roadmap for the Next Phase of SAT Research

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


Duration: 1:09:46
608 views
20

Karem Sakallah (University of Michigan)
https://simons.berkeley.edu/talks/karem-sakallah-university-michigan-2023-04-18
Satisfiability: Theory, Practice, and Beyond



Other Videos By Simons Institute for the Theory of Computing


2023-04-20Modern Constraint Programming, For People Who Know SAT
2023-04-20ASP: Theory, Practice, and Beyond
2023-04-19Logic, Optimization, and Constraint Programming: A Fruitful Collaboration
2023-04-19Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
2023-04-19Clique is hard on average for unary Sherali-Adams
2023-04-19Theoretical limits of 1UIP Learning
2023-04-19The Proof Complexity of Integer Programming
2023-04-19The Power of Unentangled Quantum Proofs With Non-negative Amplitudes | Quantum Colloquium
2023-04-19Beyond SAT - Proofs for QBF, and more
2023-04-19Isomorph-Free Generation Of Combinatorial Objects With Sat Modulo Symmetries
2023-04-18A Roadmap for the Next Phase of SAT Research
2023-04-18Structure-guided Local Improvement for Maximum Satisfiability
2023-04-18Designing Samplers is Easy: The Boon of Testers
2023-04-18IPASIR-UP: User Propagators for CDCL
2023-04-18CDCL SAT Solving and Applications to Optimization Problems
2023-04-18On Bounded Depth Proofs For Tseitin Formulas On The Grid; Revisited
2023-04-18A Survey of Automatability
2023-04-17In Search of the Hard Instances
2023-04-12Gödel and the Vicious Circle: On the (In)Feasibility of Lower Bounds
2023-04-12Quantum Pseudoentanglement | Quantum Colloquium
2023-04-05Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Satisfiability: Theory Practice and Beyond
Dean Foster