Networks and Complexity
Update: 2025-06-14
Description
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.
Comments
In Channel
Download from Google Play
Download from App Store
United States00:00
00:00
x
