Richard Karp, a leading figure in theoretical computer science, discusses the Adman's Karp algorithm, Hopcroft Karp algorithm and his landmark paper that proved 21 problems to be NP-complete, known as the P versus NP problem. The show is sponsored by Ate Sleep for a PodPro mattress and Cash App, but the ads are only at the beginning, never in the middle.