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