2min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

Is NP-Complete a Decision Problem?

NP completeness and NP-hard classes? Oh, that's just a small technicality. So when we're talking about decision problems, that means that the answer is just yes or no. On the other hand, an optimization problem would be asking, find the largest clique. And there's a very close affinity between the two kinds of 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