The most notorious problem in theoretical computer science remains open, but the attempts to solve it have led to profound insights.
The 50-year-old problem that eludes theoretical computer science
Chasing complexity, MIT News
P, NP, and NP-Completeness: The Basics of
DOC) Tools, Oracles, Genies and Sovereigns: Artificial
Home - Cat Eye Creations
Fifty Years of P vs. NP and the Possibility of the Impossible
Nuclear Physics, MIT
P, NP, and NP-Completeness: The Basics of
Genome-wide association analysis identifies novel blood pressure
The history and status of the P versus NP question
The Aged P versus NP Problem. Why is P=NP such a big deal that it