Polynomial time is a flat circle
Kent Quanrud · 48:44
Any polynomial-time algorithm can be unrolled into a polynomial-size circuit, so every search problem with a poly-time checkable certificate is equivalent to Circuit SAT / SAT. Combined with the course’s earlier reduc...