Login to filter by course Login to filter by course Reset
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Covers the median search algorithm and the Hoare algorithm for finding the smallest element in a list.
Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.
Explores the concept of exploration bias and its impact on data.
