4min chapter

Lex Fridman Podcast cover image

#183 – Po-Shen Loh: Mathematics, Math Olympiad, Combinatorics & Contact Tracing

Lex Fridman Podcast

CHAPTER

The Problem of Complexity Analysis of Computer Science Problems

Computational complexity to me is almost question one. So the annoying thing about combinatorics and discrete stuff is it's often really difficult to solve from a running time complexity perspective. Do you find that lens of studying the difficulty of how difficult the computer science problem is a useful lens onto the world? Oh, very much so.

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