Title	Proof that 3-SAT is NP-Complete Slideshow
Catalog Type	SLCItem
Persistent ID	https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/SATto3SATCON.html
Platform Name	OpenDSA
Features	Proof Visualization
Description	Slideshow demonstrating that 3-Satisfiability is NP-Complete by a reduction from Satisfiability.
Keywords	Clique Problem
Author	Nabanita Maji, Cliff Shaffer
Institution	Virginia Tech
Iframe URL	https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/SATto3SATCON.html
Protocol	LTI 1.1, SPLICE
Protocol URL	https://opendsax.cs.vt.edu/lti/launch?custom_ex_short_name=SATto3SATCON&custom_ex_settings=%7B%7D https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/SATto3SATCON.html
License	https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt
Programming Language	N/A
Natural Language	en

SPLICE Output