![Screenshot of cgi.di.uoa.gr: Reducibility Among Combinatorial Problems (1972) [pdf]](https://hn.urlbox.com/shots/renders/2026/10/27/3391f1de-46fb-4041-8c66-a9a205cb2974.jpg)
Reducibility Among Combinatorial Problems (1972) [pdf](cgi.di.uoa.gr)
6 points by liamswayne | 0 comments
PDF of Richard Karp's 1972 paper "Reducibility Among Combinatorial Problems," which showed 21 classic combinatorial problems to be NP-complete.
#np-completeness on Hacker News
1 story tagged np-completeness, newest first.