Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Introduction to the CNF Satisfiability Problem Presentation Slideshow demonstrating the CNF satisfiability problem. OpenDSA Satisfiability Problem
2 Introduction to the 3-CNF Satisfiability Problem Presentation Slideshow demonstrating the 3-CNF satisfiability problem. OpenDSA Satisfiability Problem
3 Introduction to the Circuit Satisfiability Problem Presentation Slideshow demonstrating the circuit satisfiability problem. OpenDSA Circuit Satisfiability Problem
4 3-Satisfiability Proficency Exercise Presentation Exercise User must determine whether a given 3-CNF expression has a satisfying truth assignment or not. OpenDSA Satisfiability Problem
5 Reduction of Circuit SAT to SAT Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Circuit Satisfiability problem to an instance of the CNF Satisfiability problem. OpenDSA Reduction, Satisfiability Problem
6 Reduction of 3-SAT to Clique Slideshow Presentation Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Clique problem. OpenDSA Reduction, Satisfiability Problem, Clique Problem
7 Reduction of 3-SAT to Hamiltonian Cycle Slideshow Presentation Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Hamiltonian Cycle problem. OpenDSA Reduction, Satisfiability Problem, Hamiltonian Cycle Problem
8 Proof that 3-SAT is NP-Complete Slideshow Proof Visualization Slideshow demonstrating that 3-Satisfiability is NP-Complete by a reduction from Satisfiability. OpenDSA Clique Problem