NP-Completeness | Richard Karp and Lex Fridman

Full episode with Richard Karp (Jul 2020): • Richard Karp: Algorith...
Clips channel (Lex Clips): / lexclips
Main channel (Lex Fridman): / lexfridman
(more links below)
Podcast full episodes playlist:
• Lex Fridman Podcast
Podcasts clips playlist:
• Lex Fridman Podcast Clips
Podcast website:
lexfridman.com/ai
Podcast on Apple Podcasts (iTunes):
apple.co/2lwqZIr
Podcast on Spotify:
spoti.fi/2nEwCF8
Podcast RSS:
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 UA-cam channel or connect on:
- Twitter: / lexfridman
- LinkedIn: / lexfridman
- Facebook: / lexfridman
- Instagram: / lexfridman
- Medium: / lexfridman
- Support on Patreon: / lexfridman

[@fourhourlife8594]

I have a complexity and computability exam in about 2 hours. Let's get it!

[@samirshehadeh4739]

I got one in 2 hours also 😂

[@miguellorenzo3726]

I got one in three weeks! 😂

[@GRONOPRIO]

I have understood the idea is get a problem of complexity 2^n and solve it in n^k by other way. So i focus my time in rewrite a n^k problem in log(n) complexity. Of course if thats true i can solve 3-sat. But is weird the fact that 3-sat requires for me a continous model. Instead of a logical discrete model. So i think intuitively 3-sat is solvable but the model that solve the problem is always different and unique depending of the question and not an universal model. Becouse if the model was the same i could prove p=np

[@samirshehadeh4739]

Algorithmic complexity and computability II exam in 90 min let's gooooooo

[@samirshehadeh4739]

i failed hard.

[@lashropa]

Riveting. Absolutely riveting.

[@codycast]

lol. Absolute snooze fest.

[@rinjuxe56]

It's still pending in 2 yrs

[@admarquis]

AND is the product and XOR is the mod2 addition, not OR. It's the Algebra of Boole, the real one.
Logic has been canonically solved by Norman J. Wildberger, njwildberger on UA-cam. He solved mechanically Propositional Logic. Have a look at his recent videos, his Boole-Mobius transform gives you a truth table instantly, he also solves the SAT problem beautifully. Its a shame nobody saw it before him 😊🙋‍♂️