.. _SAT:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = true;ODSA.SETTINGS.MODULE_NAME = "SAT";ODSA.SETTINGS.MODULE_LONG_NAME = "The Formula Satisfiability problem";ODSA.SETTINGS.MODULE_CHAPTER = "Limits to Computing"; ODSA.SETTINGS.BUILD_DATE = "2017-10-08 00:53:42"; 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:


.. 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

.. odsalink:: AV/Development/NP/SATCON.css

Formula Satisfiability
======================

Formula Satisfiability
----------------------

FORMULA SATISFIABILITY PROBLEM (SAT) 

.. inlineav:: SATCON ss
   :points: 0.0
   :required: True
   :threshold: 1.0
   :long_name: Formula Satisfiability
   :output: show

.. odsascript:: AV/Development/NP/SATCON.js