# Networks and Complexity

Page: https://stenobird.com/podcast/data-skeptic/networks-and-complexity
Text version: https://stenobird.com/podcast/data-skeptic/networks-and-complexity.md
Podcast: [Data Skeptic](https://stenobird.com/podcast/data-skeptic)
Published: 2025-06-14T01:05:00+00:00
Episode link: http://dataskeptic.com/blog/episodes/2025/networks-and-complexity
Audio file: https://pscrb.fm/rss/p/mgln.ai/e/35/traffic.libsyn.com/secure/dataskeptic/networks-and-complexity.mp3?dest-id=201630
Processing state: failed
JSON: https://stenobird.com/v1/public/podcasts/data-skeptic/episodes/networks-and-complexity
Duration seconds: 1069

## Resource

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.

## Actions

- request_transcript: `POST https://stenobird.com/v1/public/podcasts/data-skeptic/episodes/networks-and-complexity/transcription-requests` — Idempotently request low-priority transcript generation for this episode.
- read_markdown: `GET https://stenobird.com/podcast/data-skeptic/networks-and-complexity.md` — Read the agent-friendly Markdown representation of this episode resource.

A page view does not enqueue transcription. Agents should invoke `request_transcript` explicitly when they need this episode processed.

## Transcript

Full transcripts are not published on public pages unless there is a clear rights basis.