Lectures related to Solving Parity Games in Practice

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers the basics of algorithms, problem-solving, and efficient resolution methods.

Covers classical and quantum computational complexity concepts and implications.

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.