Algorithms for NP-Hard Problems (Section 21.5: Satisfiability Solvers)
Tim Roughgarden Lectures · 24:27
SAT solvers are the second “semi-reliable magic box” after MIP solvers: they answer feasibility—whether a set of logical constraints has any satisfying assignment, and if so, produce one—rather than optimizing a numer...