Close
Register
Close Window

CS201-OpenDSA Data Structures and Algorithms

Chapter 28 Limits to Computing

Show Source |    | About   «  28.5. Formula Satisfiability   ::   Contents   ::   28.7. The Clique Problem  »

28.6. 3-CNF Satisfiability

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

   «  28.5. Formula Satisfiability   ::   Contents   ::   28.7. The Clique Problem  »

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