Boolean Formulas and SAT

In this video, we talk about the satisfiability problem to solve boolean formulas. We introduce the satisfiability problem (or SAT for short), which was the first problem known to be NP-complete. We also discuss how other problems can be shown to be NP-complete by using polynomial reductions, introduced in the first video.