Exact Covering with Colours

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


Duration: 24:01
199 views
3

Don Knuth (Stanford)
https://simons.berkeley.edu/talks/don-knuth-stanford-2023-04-19
Satisfiability: Theory, Practice, and Beyond



Other Videos By Simons Institute for the Theory of Computing


2023-04-21Homomorphism Counts: Expressive Power and Query Algorithms
2023-04-21Proof Logging for Constraint Programming
2023-04-21Proof Logging for MaxSAT – The Past, The Present and The Future
2023-04-21Certified Static and Dynamic Symmetry Breaking
2023-04-21Trustworthy Automated Reasoning
2023-04-21MCSat Approaches for Solving Non-linear Modular Arithmetic
2023-04-21Reactive Synthesis Empowered by Logical Reasoning
2023-04-20The Power of Extended Resolution: A Practitioner's Perspective
2023-04-20Exploiting Combinatorial Structure in Constraint Programming: ...
2023-04-20Benefits of Abstract Modelling using Conjure
2023-04-20Exact Covering with Colours
2023-04-20Rado numbers: SAT methods and connections to Nullstellensatz complexity
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


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