Karp's 1972 Paper on Reducibility Among Combinatorial Problems Resurfaces on Hacker News
A PDF of Richard Karp's 1972 paper "Reducibility Among Combinatorial Problems" has been shared on Hacker News, where it drew a small amount of attention. The document, hosted on a university course website, is a classic work in computational complexity theory. It identifies 21 combinatorial problems that Karp showed to be NP-complete by reducing them from the satisfiability problem. The post itself had three points and no comments at the time of the listing, so the discussion around it remained minimal.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)
Log in to join the discussion and vote.
Log in