Close
Register
Close Window

CSC215: Algorithm Design and Analysis

Chapter 16 Limits to Computing

Show Source |    | About   «  16.5. Formula Satisfiability   ::   Contents   ::   16.7. The Clique Problem  »

16.6. 3-CNF Satisfiability

16.6.1. 3-CNF Satisfiability (3-SAT)

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

Try out an instance of the 3-SAT problem on your own.

   «  16.5. Formula Satisfiability   ::   Contents   ::   16.7. The Clique Problem  »

© Copyright 2011-2025 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Jan 25, 2025. Created using Sphinx 6.0.0.
Close Window