SAT - A different kind of search problem
Kent Quanrud · 63:53
Boolean SAT looks like the kind of discrete, tree-shaped problem computers should crush, but this lecture argues there is no known polynomial-time algorithm for general formulas — and then shows, via size-preserving r...