Non-CDCL Solvers

Non-CDCL Solvers

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


Duration: 1:58:30
842 views
24

Marijn Heule (Carnegie Mellon University), Jakob Nordstrom (University of Copenhagen & Lund University), and Zhiwei Zhang (Rice University)
https://simons.berkeley.edu/talks/non-cdcl-solvers
Theoretical Foundations of SAT/SMT Solving



Other Videos By Simons Institute for the Theory of Computing


2021-03-26Subgame Perfect Equilibria
2021-03-25Information Efficiency of Proof Systems
2021-03-25Proofs and Circuits: Connections via Interpolation and Lifting
2021-03-24Knowledge Compilation for Boolean Functional Synthesis
2021-03-22Dreamcoder: Bootstrapping Inductive Program Synthesis With Wake-Sleep Library Learning
2021-03-22Program Synthesis via Deep Learning over Graph Structured Data
2021-03-22Liquid Time Constant Networks
2021-03-22Towards Human-Like Program Synthesis
2021-03-19Trustworthy and Distributed Automated Reasoning
2021-03-18Belief and Survey Propagation
2021-03-17Non-CDCL Solvers
2021-03-17Panel & Questions | Quantum Colloquium
2021-03-17Towards Practical Quantum Advantage | Quantum Colloquium
2021-03-17What Maximum Clique Algorithms Can Teach Us, And Vice-Versa
2021-03-17Tutorial Session: Introduction to Quantum Chemistry | Quantum Colloquium
2021-03-15A Brief Introduction to Theoretical Foundations of Machine Learning and Machine Teaching
2021-03-12United for Change: Deliberative Coalition Formation to Change the Status Quo
2021-03-11Are we aging well?
2021-03-11The Dawn of Computational Complexity Theory
2021-03-10Quantum Fault Tolerance with Flag Qubits | Quantum Colloquium
2021-03-09Beyond NP with Tractable Circuits


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Theoretical Foundations of SAT/SMT Solving
Marijn Heule
Jakob Nordstrom
Zhiwei Zhang