2min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

What Are the Most Convincing Open Problems in Computer Science?

There are all kinds of relationships among complexity classes that can be studied. If P is equal to NP, then these problems will have small circuits. But what about the converse? Could a problem have small circuits, meaning that an algorithm tailored to any particular size could work well and yet not be a polynomial time algorithm? That is, you couldn't write it as a single uniform algorithm good for all sizes.

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