Close
Close Window

OpenDSA Stand-alone Modules

Chapter 0 modules

Show Source |    | About   «  214. Formula Satisfiability   ::   Contents   ::   216. The Clique Problem  »

215. 3-CNF Satisfiability

215.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.

   «  214. Formula Satisfiability   ::   Contents   ::   216. The Clique Problem  »

nsf
Close Window