Close
Register
Close Window

Chapter 33 Limits to Computing

Show Source |    | About   «  33.5. Formula Satisfiability   ::   Contents   ::   33.7. The Clique Problem  »

33.6. 3-CNF Satisfiability

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

   «  33.5. Formula Satisfiability   ::   Contents   ::   33.7. The Clique Problem  »

nsf

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