Close
Register
Close Window

OpenDSA Stand-alone Modules

Chapter 0 modules

Show Source |    | About   «  211. Formula Satisfiability   ::   Contents   ::   213. The Clique Problem  »

212. 3-CNF Satisfiability

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

   «  211. Formula Satisfiability   ::   Contents   ::   213. The Clique Problem  »

nsf

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