Course contentsShow
Computer Science
Lesson 1915 of 2,87243. Complexity TheoryPro lesson

The Satisfiability Problem (SAT)

Introducing the Boolean satisfiability problem: determining if a logical formula has a satisfying assignment.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.