Satisfiability Problem — Study Resources & PYQs
Satisfiability problem (SAT)
- Estimated study time: 33 minutes
Study resources
- Non-Deterministic Algorithms / Satisfiability / Cook's Theorem (Video) — Video lecture by Abdul Bari covering NP-Hard, NP-Complete, satisfiability, and reductions visually.
Taught in these subjects
- Analysis & Design of Algorithms — CST-3501 · Government College of Engineering and Technology, Jammu