SAT solvers
Powerful programs that, in practice, reliably solve instances of the satisfiability problem with millions of variables, despite the problem being NP-complete in the worst case.
Save the 3 videos on SAT solvers to your own pod.
Sign up free to keep building your knowledge base on SAT solvers as more episodes are added.
Videos Mentioning SAT solvers
Peter Norvig: Artificial Intelligence: A Modern Approach | Lex Fridman Podcast #42
Lex Fridman
Algorithms used to determine the satisfiability of a boolean formula, mentioned as efficient tools related to predicate logic.
Donald Knuth: Algorithms, Complexity, and The Art of Computer Programming | Lex Fridman Podcast #62
Lex Fridman
Algorithms for solving boolean satisfiability problems, which became a standard way to design computers after BDDs and are a major topic in Volume 4B of 'The Art of Computer Programming'.
Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
Lex Fridman
Powerful programs that, in practice, reliably solve instances of the satisfiability problem with millions of variables, despite the problem being NP-complete in the worst case.