Maximum Satisfiability Solving

Maximum Satisfiability Solving

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


Duration: 2:24:00
886 views
24

Jeremias Berg (University of Helsinki), Matti Järvisalo (University of Helsinki), and Ruben Martins (CMU)
https://simons.berkeley.edu/talks/maxsat
Beyond Satisfiability



Other Videos By Simons Institute for the Theory of Computing


2021-04-21Computer Algebra and SAT for Mathematical Search
2021-04-21Panel Discussion on Postquantum Cryptography | Quantum Colloquium
2021-04-21Postquantum Cryptography | Quantum Colloquium
2021-04-20Step-Wise Explanations for Constraint Programs
2021-04-19Richard M. Karp Distinguished Lecture — How Difficult is it to Certify that a Random SAT Formula is
2021-04-16Distributed Computing Meets Game Theory: Fault Tolerance and Implementation with Cheap Talk
2021-04-15Complexity and Diversity
2021-04-15SAT and Foundations of Mathematics
2021-04-14Panel Discussion on Quantum Simulation | Quantum Colloquium
2021-04-14Quantum Simulation | Quantum Colloquium
2021-04-14Maximum Satisfiability Solving
2021-04-12Synthesizing Randomized Systems with Algorithmic Improvisation
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


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Beyond Satisfiability
Jeremias Berg
Matti Järvisalo
Ruben Martins