Close
Register
Close Window

OpenDSA Stand-alone Modules

Chapter 0 modules

Show Source |    | About   «  0.218. NP-Completeness Proofs   ::   Contents   ::   0.220. Reduction of SAT to 3-SAT  »

Reduction of Circuit SAT to SAT

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.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

This reduction can help in providing an NP Completeness proof for SAT.

   «  0.218. NP-Completeness Proofs   ::   Contents   ::   0.220. Reduction of SAT to 3-SAT  »

nsf

© Copyright 2016 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Jul 03, 2019. Created using Sphinx 1.2.
Close Window