Post

My occasional reminder that the solution to P v NP is not around the corner. The claimed refutation to ETH doesn't reduce the running times of NP problems in general, such as 3-coloring or CNF-SAT with no bounds on the clause size. We still have no approach to settling P v NP.