Close
Close Window

JMU CS327 Discrete Structures II, Spring 2019

Chapter 2 Limits to Computing

Show Source |    | About   «  2.5. Formula Satisfiability   ::   Contents   ::   2.7. The Clique Problem  »

2.6. 3-CNF Satisfiability

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

   «  2.5. Formula Satisfiability   ::   Contents   ::   2.7. The Clique Problem  »

nsf

© Copyright 2016 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Jan 03, 2019. Created using Sphinx 1.2.
Close Window