Close
Register
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)

Settings

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

© Copyright 2016 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Apr 04, 2020. Created using Sphinx 1.2.
Close Window