Close
Register
Close Window

F17 OpenDSA entire modules

Chapter 34 Limits to Computing

Show Source |    | About   «  34.5. Formula Satisfiability   ::   Contents   ::   34.7. The Clique Problem  »

34.6. 3-CNF Satisfiability

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

   «  34.5. Formula Satisfiability   ::   Contents   ::   34.7. The Clique Problem  »

nsf

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