Reducibility Among Combinatorial Problems

Book

Richard Karp's landmark paper in complexity theory that proved 21 problems to be NP-complete, significantly influencing the study of NP-completeness and the P versus NP problem.

Mentioned in 1 video

Videos Mentioning Reducibility Among Combinatorial Problems

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Lex Fridman

Richard Karp's landmark paper in complexity theory that proved 21 problems to be NP-complete, significantly influencing the study of NP-completeness and the P versus NP problem.