Exam Q&A Session

Related lectures (22)

Page 1 of 3

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

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

Covers the basics of distributed algorithms and their importance in building reliable and secure systems.

Delves into the complexity of factoring polynomials and the implications for security.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores how randomness and recursion can be used to efficiently find the median of a list.

Explores the existence of functions that cannot be computed, illustrated by famous paradoxes and the concept of undecidable problems.