.. _SAT_to_threeSAT:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = true;ODSA.SETTINGS.MODULE_NAME = "SAT_to_threeSAT";ODSA.SETTINGS.MODULE_LONG_NAME = "Reduction of SAT to 3-SAT";ODSA.SETTINGS.MODULE_CHAPTER = "Limits to Computing"; ODSA.SETTINGS.BUILD_DATE = "2020-07-27 14:12:43"; ODSA.SETTINGS.BUILD_CMAP = false;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/NP/SATto3SATCON.css
.. This file is part of the OpenDSA eTextbook project. See
.. http://opendsa.org for more details.
.. Copyright (c) 2012-2020 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

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

Reduction of SAT to 3-SAT
=========================

Reduction of SAT to 3-SAT
-------------------------

The following slideshow shows that an instance of Formula Satisfiability 
problem can be reduced to an instance of 3 CNF Satisfiability problem in 
polynomial time.
 
.. inlineav:: SATto3SATCON ss
   :points: 0.0
   :required: False
   :threshold: 1.0
   :id: 199299
   :output: show

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

.. odsascript:: AV/NP/SATto3SATCON.js