Close
Register
Close Window

Data Structures and Problem Solving

Chapter 21 Limits to Computing

Show Source |    | About   «  21.5. Formula Satisfiability   ::   Contents   ::   21.7. The Clique Problem  »

21.6. 3-CNF Satisfiability

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

   «  21.5. Formula Satisfiability   ::   Contents   ::   21.7. The Clique Problem  »

nsf

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