Loading [MathJax]/jax/output/HTML-CSS/jax.js
Close
Close Window

Formal Languages With Visualizations

Chapter 11 Limits to Computing

Show Source |    | About   «  11.4. Formula Satisfiability   ::   Contents   ::   11.6. Reduction of SAT to 3-SAT  »

11.5. 3-CNF Satisfiability

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

   «  11.4. Formula Satisfiability   ::   Contents   ::   11.6. Reduction of SAT to 3-SAT  »

nsf
Close Window