Close
Register
Close Window

Senior Algorithms

Chapter 8 Limits to Computing

Show Source |    | About   «  8.6. Formula Satisfiability   ::   Contents   ::   8.8. The Clique Problem  »

8.7. 3-CNF Satisfiability

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

   «  8.6. Formula Satisfiability   ::   Contents   ::   8.8. The Clique Problem  »

nsf

© Copyright 2011-2023 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Oct 01, 2023. Created using Sphinx 4.4.0.
Close Window