4min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

Polynomial Time Algorithms - The Class of Problems Solvable in Polynomial Time

In theory, when we measure the complexity of an algorithm, we really measure the number of steps. If there's any case where it gets into a very long computation, that would increase the computational complexity by this measure. And in practice, it's oftentimes reducing from an N squared algorithm to an N log N, or linear time, is practically the jump that you want to make to allow a real world system to solve a problem.

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