6.15. Reduction of 3-SAT to Clique¶
6.15.1. Reduction of 3-SAT to Clique¶
The following slideshow shows that an input instance to the 3-SAT problem can be reduced to an equivalent input instance to the CLIQUE problem in polynomial time.
This reduction can help in providing an NP Completeness proof for the Clique problem.
