Reducibility

Twenty-one NP-complete problems, twenty-one programming languages. A polyglot tour of the original landscape Karp drew in 1972.

After Richard M. Karp, Reducibility Among Combinatorial Problems, in R. E. Miller & J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85–103.

21 chapters · 63 sections.