.. _circuitSAT_to_SAT:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = true;ODSA.SETTINGS.MODULE_NAME = "circuitSAT_to_SAT";ODSA.SETTINGS.MODULE_LONG_NAME = "Reduction of Circuit SAT to SAT";ODSA.SETTINGS.MODULE_CHAPTER = "Limits to Computing"; ODSA.SETTINGS.BUILD_DATE = "2019-04-01 22:21:50"; ODSA.SETTINGS.BUILD_CMAP = true;JSAV_OPTIONS['lang']='en';JSAV_EXERCISE_OPTIONS['code']='java';</script>


.. |--| unicode:: U+2013   .. en dash
.. |---| unicode:: U+2014  .. em dash, trimming surrounding whitespace
   :trim:



.. odsalink:: AV/Development/NP/circuitSATtoSATCON.css
.. This file is part of the OpenDSA eTextbook project. See
.. http://algoviz.org/OpenDSA for more details.
.. Copyright (c) 2012-2013 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. avmetadata::
   :author: Nabanita Maji
   :topic: NP-completeness

Reduction of Circuit SAT to SAT
===============================

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.
 
.. inlineav:: circuitSATtoSATCON ss
   :points: 0.0
   :required: False
   :threshold: 1.0
   :id: 151331
   :long_name: Circuit SAT to SAT
   :output: show

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

.. odsascript:: AV/Development/NP/circuit/circuit.js
.. odsascript:: AV/Development/NP/circuitSATtoSATCON.js