Close
Register
Close Window
Report a bug
Close Window

OpenDSA: All Modules + TODO List

Chapter 21 Limits to Computing

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

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

   «  21.14. Reduction of SAT to 3-SAT   ::   Contents   ::   21.16. Reduction of Clique to Independent Set  »

nsf