Close
Close Window

Data Structures and Problem Solving

Chapter 21 Limits to Computing

Show Source |    | About   «  21.5. Formula Satisfiability   ::   Contents   ::   21.7. The Clique Problem  »

21.6. 3-CNF Satisfiability

21.6.1. 3-CNF Satisfiability

3-CNF SATISFIABILITY PROBLEM (3-SAT)

1 / 18 Settings
<<<>>>


Introduction to 3-CNF Satisfiability

This slideshow introduces and explains the "3-CNF Satisfiability" (3-SAT) Problem.


We start with some definitions and background.
Proficient Saving... Error Saving
Server Error
Resubmit

Try out an instance of the 3-SAT problem on your own.

   «  21.5. Formula Satisfiability   ::   Contents   ::   21.7. The Clique Problem  »

nsf
Close Window