Episode
Networks and Complexity
- Podcast
- Data Skeptic
- Published
- Jun 14, 2025
- Duration seconds
- 1069
- Processing state
failed
Actions
POST https://stenobird.com/v1/public/podcasts/data-skeptic/episodes/networks-and-complexity/transcription-requests
Idempotently request low-priority transcript generation for this episode.GET https://stenobird.com/podcast/data-skeptic/networks-and-complexity.md
Read the agent-friendly Markdown representation of this episode resource.
Summary
In this episode, Kyle does an overview of the intersection of graph theory and computational complexity theory. In complexity theory, we are about the runtime of an algorithm based on its input size. For many graph problems, the interesting questions we want to ask take longer and longer to answer! This episode provides the fundamental vocabulary and signposts along the path of exploring the intersection of graph theory and computational complexity theory.