The most notorious problem in theoretical computer science remains open, but the attempts to solve it have led to profound insights.
Fifty Years of P vs. NP and the Possibility of the Impossible
elegans developers
The Aged P versus NP Problem. Why is P=NP such a big deal that it
The Aged P versus NP Problem. Why is P=NP such a big deal that it
NP (complexity) - Wikipedia
Frontiers Applications and Techniques for Fast Machine Learning
The Computing issue MIT Technology Review
16. Complexity: P, NP, NP-completeness, Reductions
Suzie Palmer
16. Complexity: P, NP, NP-completeness, Reductions