28.13. Reduction of Circuit SAT to SAT¶
28.13.1. Reduction of Circuit SAT to SAT¶
The following slideshow shows that an instance of Circuit Satisfiability problem can be reduced to an instance of SAT problem in polynomial time.
This reduction can help in providing an NP Completeness proof for SAT.
