Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Quantum Random Number GenerationExplores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.
Shortest Path in Directed GraphsCovers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Elements of Computational ComplexityIntroduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Complexity Classes: P and NPExplores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
Dynamic Programming: KnapsackExplores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
