2min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

The Satisfiability Problem of Propositional Logic

The satisfiability problem of propositional logic is solvable in polynomial time. The P can be re-expressed as simply asking whether the satisfiability problems are easy to check. It's adding so much more weight to the P equals NP question, because all it takes is to show that one algorithm in this class could do it. But there's more. I saw Cook's paper when he published it in a conference in 1971. And then began looking for reductions from the satisfiability to other problems.

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode