NP-overrated
Summary
The article argues that NP-hard problems are not intractable in practice, suggesting that heuristic methods and improved algorithms often solve the vast majority of real-world inputs efficiently. It cites examples like dependency resolution, type checking, scheduling, traveling salesman, SAT/ SMT, and references tools and speedups to show that theory and practice diverge, with practical solutions and fallback strategies for worst-case scenarios.