ZARZA We are Zarza, the prestigious firm behind major projects in information technology.
Listen "Networks and Complexity"
Episode Synopsis
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.
More episodes of the podcast Data Skeptic
Video Recommendations in Industry
26/12/2025
Eye Tracking in Recommender Systems
18/12/2025
Cracking the Cold Start Problem
08/12/2025
Shilling Attacks on Recommender Systems
05/11/2025
Music Playlist Recommendations
29/10/2025
Bypassing the Popularity Bias
15/10/2025
Sustainable Recommender Systems for Tourism
09/10/2025
Interpretable Real Estate Recommendations
22/09/2025
In God we trust