We knew we could use an efficient algorithm for NP problems to find proofs of mathematical theorems. Now that AI is doing that, is there anything remaining, outside of breaking codes, where P = NP solves practical problems that AI and optimization can't?
blog.computationalcomplexity.org/2026/11/anothe…
Computational Complexity Theorist

