SAT: A different kind of search problem
Kent Quanrud · 68:46
This lecture shows that the Boolean satisfiability (SAT) problem has no known polynomial-time algorithm, and that Boolean-formula SAT, CNF-SAT, 3-SAT and Circuit-SAT are all equivalent in difficulty. The tool is a red...