are problems whose solutions are easy to verify also easy to solve?
Open question,
M Millennium Prize. P = solvable in polynomial time. NP = verifiable in polynomial time. Most experts believe P ≠ NP. Why we use approximations and heuristics for NP-hard problems.