Math & science · 1971
NP-completeness
Cook shows that many hard problems are equally hard, framing P versus NP.
Cook's theorem and Karp's 21 problems (1972) sorted problems by their computational cost. P versus NP is now a Millennium Prize problem.
Math & science · 1971
Cook shows that many hard problems are equally hard, framing P versus NP.
Cook's theorem and Karp's 21 problems (1972) sorted problems by their computational cost. P versus NP is now a Millennium Prize problem.