Art of the Problem on MSNOpinion

P vs NP, the question that separates easy problems from hard ones

Some problems are easy to solve, others seem impossibly hard, but no one knows if that distinction is real or an illusion.
Communications of the ACM

I Spent a Year Asking AI to Solve Math’s Hardest Problem. Here’s What Happened

P vs. NP asks: are these two classes actually the same? If P = NP, then every “hard” problem is secretly fast to solve; we ...