Skip to content
Lex Fridman PodcastLex Fridman Podcast

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

Richard Karp is a professor at Berkeley and one of the key figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds–Karp algorithm for solving the maximum flow problem on networks, Hopcroft–Karp algorithm for finding maximum cardinality matchings in bipartite graphs, and his landmark paper in complexity theory called "Reducibility Among Combinatorial Problems", in which he proved 21 problems to be NP-complete. This paper was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem. Support this podcast by signing up with these sponsors: - Eight Sleep: https://eightsleep.com/lex - Cash App - use code "LexPodcast" and download: - Cash App (App Store): https://apple.co/2sPrUHe - Cash App (Google Play): https://bit.ly/2MlvP5w EPISODE LINKS: Richard's wikipedia: https://en.wikipedia.org/wiki/Richard_M._Karp PODCAST INFO: Podcast website: https://lexfridman.com/podcast Apple Podcasts: https://apple.co/2lwqZIr Spotify: https://spoti.fi/2nEwCF8 RSS: https://lexfridman.com/feed/podcast/ Full episodes playlist: https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4 Clips playlist: https://www.youtube.com/playlist?list=PLrAXtmErZgOeciFP3CBCIEElOJeitOr41 OUTLINE: 0:00 - Introduction 3:50 - Geometry 9:46 - Visualizing an algorithm 13:00 - A beautiful algorithm 18:06 - Don Knuth and geeks 22:06 - Early days of computers 25:53 - Turing Test 30:05 - Consciousness 33:22 - Combinatorial algorithms 37:42 - Edmonds-Karp algorithm 40:22 - Algorithmic complexity 50:25 - P=NP 54:25 - NP-Complete problems 1:10:29 - Proving P=NP 1:12:57 - Stable marriage problem 1:20:32 - Randomized algorithms 1:33:23 - Can a hard problem be easy in practice? 1:43:57 - Open problems in theoretical computer science 1:46:21 - A strange idea in complexity theory 1:50:49 - Machine learning 1:56:26 - Bioinformatics 2:00:37 - Memory of Richard's father CONNECT: - Subscribe to this YouTube channel - Twitter: https://twitter.com/lexfridman - LinkedIn: https://www.linkedin.com/in/lexfridman - Facebook: https://www.facebook.com/LexFridmanPage - Instagram: https://www.instagram.com/lexfridman - Medium: https://medium.com/@lexfridman - Support on Patreon: https://www.patreon.com/lexfridman

Lex FridmanhostRichard Karpguest
Jul 26, 20202h 7mWatch on YouTube ↗

CHAPTERS

  1. 0:00 – 3:50

    Introduction

  2. 3:50 – 9:46

    Geometry

  3. 9:46 – 13:00

    Visualizing an algorithm

  4. 13:00 – 18:06

    A beautiful algorithm

  5. 18:06 – 22:06

    Don Knuth and geeks

  6. 22:06 – 25:53

    Early days of computers

  7. 25:53 – 30:05

    Turing Test

  8. 30:05 – 33:22

    Consciousness

  9. 33:22 – 37:42

    Combinatorial algorithms

  10. 37:42 – 40:22

    Edmonds-Karp algorithm

  11. 40:22 – 50:25

    Algorithmic complexity

  12. 50:25 – 54:25

    P=NP

  13. 54:25 – 1:10:29

    NP-Complete problems

  14. 1:10:29 – 1:12:57

    Proving P=NP

  15. 1:12:57 – 1:20:32

    Stable marriage problem

  16. 1:20:32 – 1:33:23

    Randomized algorithms

  17. 1:33:23 – 1:43:57

    Can a hard problem be easy in practice?

  18. 1:43:57 – 1:46:21

    Open problems in theoretical computer science

  19. 1:46:21 – 1:50:49

    A strange idea in complexity theory

  20. 1:50:49 – 1:56:26

    Machine learning

  21. 1:56:26 – 2:00:37

    Bioinformatics

  22. 2:00:37 – 2:07:32

    Memory of Richard's father

Get more out of YouTube videos.

High quality summaries for YouTube videos. Accurate transcripts to search & find moments. Powered by ChatGPT & Claude AI.

Add to Chrome