Networks and Complexity

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.

Guest

Kyle Polich: Kyle is the founder of Data Skeptic, a popular podcast about artificial intelligence, machine learning, and data science. Outside of hosting the show, he runs a boutique consulting group that helps small and medium enterprise companies deploy data driven automated solutions in the cloud.