3min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

Is There a Small Circuit for a Problem of Particular Size?

Is the Hamiltonian circuit problem have a small circuit for every size, for each size? In other words, could you tailor solutions, depending on the size and get polynomial size? Even if P is not equal to NP. That would be fascinating if that's true. Yeah. What we proved is that, if that were possible, then something strange would happen in complexity theory. Some high level class which I could briefly describe.

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