Classifying the Complexity of SAT and CSP: Are we there yet?

Classifying the Complexity of SAT and CSP: Are we there yet?

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


Duration: 1:10:11
460 views
10

Andrei Krokhin (Durham University)
https://simons.berkeley.edu/talks/tbd-293
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-12Automated Verification and Control Synthesis for CPS Models
2021-04-12Synthesis of Safe, Small and Optimal Strategies for Cyber-Physical Systems
2021-04-12Towards the Automated Synthesis of Probabilistic Programs
2021-04-11A Homological Theory of Functions
2021-04-11A Spectral Approach to Polytope Diameter - Part 2
2021-04-11A Spectral Approach to Polytope Diameter - Part 1
2021-04-11The Top Weight Cohomology of A_g
2021-04-11Graphs and Arithmetic Geometry
2021-04-10Breaking Symmetries in Graphs
2021-04-09Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Imperfect-Information G
2021-04-08Classifying the Complexity of SAT and CSP: Are we there yet?
2021-04-08Branching on Formulas: A Perspective From Knowledge Compilation
2021-04-07Finite Model Theory
2021-04-07The Area-Law Conjecture in Many-Body Quantum Physics | Quantum Colloquium
2021-04-07Tutorial Session on Ground States of Local Hamiltonians | Quantum Colloquium
2021-04-06Answer Set Programming in a Nutshell
2021-04-05Counterexample Guided Inference of Modular Specifications
2021-04-05Visualization By Example
2021-04-05Counterexample-guided Repair in Boolean Functional Synthesis
2021-04-05Guarantees in Syntax-Guided Synthesis
2021-04-01SAT for Optimization


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