Networks and Complexity

Complex systems often make more sense once we map the relationships inside them. 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.

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.