Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond

Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
69,300
Published on ● Video Link: https://www.youtube.com/watch?v=rEyCwoD-RwI


Duration: 1:07:25
692 views
26

Holger Hoos (Leiden University & University of British Columbia)
https://simons.berkeley.edu/talks/tbd-307
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing



Other Videos By Simons Institute for the Theory of Computing


2021-05-12Constrained Gradient Descent Algorithm for Testing Neural Networks
2021-05-12DL2: Training and Querying Neural Networks with Logic
2021-05-12Training Neural Networks with a Little Help from Knowledge
2021-05-12Unifying Logical and Statistical AI with Markov Logic
2021-05-12Panel Discussion on Quantum Algorithms for Optimization | Quantum Colloquium
2021-05-12Quantum Algorithms for Optimization | Quantum Colloquium
2021-05-11The Multilinear Polytope for Acyclic Hypergraphs
2021-05-10Panel Discussion on Challenges and Opportunities in Synthesis
2021-05-07Formal Languages and Automata for Reward Function Specification and Efficient Reinforcement Learning
2021-05-07Avenir: Managing Data Plane Diversity via Control Plane Synthesis
2021-05-06Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond
2021-05-06Using Program Synthesis to Build Compilers
2021-05-05Preprocessing SAT, MaxSAT, and QBF 3
2021-05-05Preprocessing SAT, MaxSAT, and QBF 2
2021-05-05Preprocessing SAT, MaxSAT, and QBF 1
2021-05-05Panel Discussion on The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-05The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-04Towards ML for Quantification in SMT
2021-05-03Data-Driven Synthesis of a Provably Sound Side-Channel Analysis
2021-05-03Synthesizing Network Configuration Updates
2021-04-30Computational Aspects of Equilibria and Fixed Points


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