2min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

Is There an Equivalent in Complexity Analysis?

Don Knuth started to collect examples of graphs coming from various places. So he would have a whole zoo of different graphs that he could choose from and study the performance of algorithms on different types of graphs. We don't really have that for problems, for combinatorial problems on graphs and networks. There's been a big growth of datasets available. The actual act of defining a class of graphs that you're interested in seems to be a non-trivial step before talking about instances that we should care about in the real world.

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