
Sign up to save your podcasts
Or
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.
4.4
472472 ratings
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.
161 Listeners
590 Listeners
622 Listeners
444 Listeners
297 Listeners
323 Listeners
141 Listeners
267 Listeners
192 Listeners
139 Listeners
287 Listeners
87 Listeners
200 Listeners
75 Listeners
459 Listeners