2min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

The Clique Problem

The goal is to make every single clause true if it's possible to satisfy this and the way you make it true is at least one term in the clause must be true. So we can construct a graph where the vertices are the terms in all of the clauses and you have an edge between two terms. And so you get a graph where you have all of these occurrences of variables, you have edges, which mean that you're not allowed to choose both ends of the edge either because they're in the same clause or they're conjugations of one another.

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