Close
Register
Close Window

OpenDSA Stand-alone Modules

Chapter 0 modules

Show Source |    | About   «  0.223. Reduction of SAT to 3-SAT   ::   Contents   ::   0.225. Reduction of Clique to Independent Set  »

Reduction of 3-SAT to Clique

1. Reduction of 3-SAT to Clique

The following slideshow shows that an instance of 3-CNF Satisfiability problem can be reduced to an instance of Clique problem in polynomial time.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

This reduction can help in providing an NP Completeness proof for the Clique problem.

   «  0.223. Reduction of SAT to 3-SAT   ::   Contents   ::   0.225. Reduction of Clique to Independent Set  »

nsf

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