Computational Complexity | EPFL Graph Search

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

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

Covers classical and quantum computational complexity concepts and implications.

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

Explores Turing machines, recursive languages, and decidability in the theory of computation.