Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman
Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs
Clips channel (Lex Clips): https://www.youtube.com/lexclips
Main channel (Lex Fridman): https://www.youtube.com/lexfridman
(more links below)
Podcast full episodes playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4
Podcasts clips playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOeciFP3CBCIEElOJeitOr41
Podcast website:
https://lexfridman.com/ai
Podcast on Apple Podcasts (iTunes):
https://apple.co/2lwqZIr
Podcast on Spotify:
https://spoti.fi/2nEwCF8
Podcast RSS:
https://lexfridman.com/category/ai/feed/
Richard Karp is a professor at Berkeley and one of the most important 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.
Subscribe to this YouTube channel or connect on:
- Twitter: https://twitter.com/lexfridman
- LinkedIn: https://www.linkedin.com/in/lexfridman
- Facebook: https://www.facebook.com/lexfridman
- Instagram: https://www.instagram.com/lexfridman
- Medium: https://medium.com/@lexfridman
- Support on Patreon: https://www.patreon.com/lexfridman
Видео Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman канала Lex Clips
Clips channel (Lex Clips): https://www.youtube.com/lexclips
Main channel (Lex Fridman): https://www.youtube.com/lexfridman
(more links below)
Podcast full episodes playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4
Podcasts clips playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOeciFP3CBCIEElOJeitOr41
Podcast website:
https://lexfridman.com/ai
Podcast on Apple Podcasts (iTunes):
https://apple.co/2lwqZIr
Podcast on Spotify:
https://spoti.fi/2nEwCF8
Podcast RSS:
https://lexfridman.com/category/ai/feed/
Richard Karp is a professor at Berkeley and one of the most important 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.
Subscribe to this YouTube channel or connect on:
- Twitter: https://twitter.com/lexfridman
- LinkedIn: https://www.linkedin.com/in/lexfridman
- Facebook: https://www.facebook.com/lexfridman
- Instagram: https://www.instagram.com/lexfridman
- Medium: https://medium.com/@lexfridman
- Support on Patreon: https://www.patreon.com/lexfridman
Видео Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman канала Lex Clips
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
The odds that P=NP is 3% | Scott Aaronson and Lex FridmanBeyond Computation: The P versus NP question (panel discussion)P vs. NP and the Computational Complexity ZooDonald Knuth: P=NP | AI Podcast ClipsRichard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111The Math Problem With a $1 Million Prize for SolvingWhat is complexity theory? (P vs. NP explained visually)Poincaré Conjecture - NumberphileThe unsolved math problem which could be worth a billion dollars.P vs. NP - An IntroductionCan we prove P=NP and not find the algorithm? | Scott Aaronson and Lex FridmanLex Fridman talks about being the same person in private and in publicWhat Computers Can't Do - with Kevin BuzzardNP-Completeness | Richard Karp and Lex FridmanP vs. NP - The Biggest Unsolved Problem in Computer ScienceMost people don't think deeply about death | Sheldon Solomon and Lex FridmanWhy Lex Fridman is singleWhy Most P vs. NP Attempts FailP vs NP on TV - Computerphile