2min chapter

Lex Fridman Podcast cover image

Donald Knuth: Algorithms, TeX, Life, and The Art of Computer Programming

Lex Fridman Podcast

CHAPTER

Theorem of Polynomial Time Algorithms

There are lots of algorithms that are known for special class of graphs. A minor is everything you can get by shrinking and removing it. Given any minor there's a polynomial time algorithm saying, I can tell whether this is a minor of you. And so all I have to do is test whether or not that does this given graph have a minor that's one of the bad ones.

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