Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the intricacies of fine-grained complexity and algorithm design for graph reachability and distance problems in this 52-minute lecture by Karl Bringmann from the Max Planck Institute for Informatics. Delve into the fascinating world of graph theory and computational complexity as part of the "Fine-Grained Complexity, Logic, and Query Evaluation" series presented by the Simons Institute. Gain insights into advanced algorithmic techniques and their applications in solving complex graph-related challenges, enhancing your understanding of theoretical computer science and its practical implications.
