Close
Register
Close Window

RHS Comp Sci III

Chapter 25 Limits to Computing

Show Source |    | About   «  25.5. Formula Satisfiability   ::   Contents   ::   25.7. The Clique Problem  »

25.6. 3-CNF Satisfiability

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

   «  25.5. Formula Satisfiability   ::   Contents   ::   25.7. The Clique Problem  »

nsf

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