1 rich Libsyn https://www.libsyn.com 90 600 In this episode, Kyle does an overview of the intersection of graph theory and computational complexity theory.&amp;nbsp; In complexity theory, we are about the runtime of an algorithm based on its input size.&amp;nbsp; For many graph problems, the interesting questions we want to ask take longer and longer to answer!&amp;nbsp; This episode provides the fundamental vocabulary and signposts along the path of exploring the intersection of graph theory and computational complexity theory. Data Skeptic https://dataskeptic.com <iframe title="Libsyn Player" style="border: none" src="//html5-player.libsyn.com/embed/episode/id/37008275/height/90/theme/custom/thumbnail/yes/direction/forward/render-playlist/no/custom-color/88AA3C/" height="90" width="600" scrolling="no" allowfullscreen webkitallowfullscreen mozallowfullscreen oallowfullscreen msallowfullscreen></iframe> https://assets.libsyn.com/secure/item/37008275