Elements of computational complexity

Related lectures (28)

Page 1 of 3

Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.

Covers the mechanisms behind quantum computation and explores the advantages of restricted computational models.

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

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

Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.

Covers the Deutsch and Deutsch-Jozsa algorithms in quantum computing, explaining the principles behind them and their implications.

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Explores groups and numbers, emphasizing the hidden subgroup problem and its complexities in classic and quantum algorithms.

Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.