NP-Complete
Kent Quanrud · 74:28
Any polynomial-time algorithm can be unrolled into a polynomial-size circuit, and every “search problem” (yes-instances have a short, efficiently checkable certificate) is therefore Circuit SAT of polynomial size. Tha...