5min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

How Randomness Works in Propositional Logic?

Algorithm for counting the number of solutions that satisfy a particular formula in propositional logic is based on random sampling. So what you do is you sample from the formulas according to the number of Solutions that satisfy each individual one. If a row has more ones, it gets drawn more frequently. But then if you draw from that row, you have to go up the column and looking at where that same one is repeated in different rows. And only count it as a success or a hit if it's the earliest row that contains the one.

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