Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This undergraduate lecture studies the satisfiability problem across Boolean circuits, formulas, CNF, k-SAT, 3-SAT, and 2-SAT. It explains their relationships, complexity, NP-completeness, and a polynomial-time algorithm for 2-SAT.
