Elements of computational complexity

Related lectures (28)

Page 3 of 3

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

Explores recent progress in quantum computational advantage and discusses the challenges in achieving quantum supremacy.

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

Introduces complexity classes, including P and NP, and explores examples of easy and hard problems.

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Explains Grover's Quantum Search Algorithm, which outperforms classical algorithms in searching unstructured databases using O(√N) queries.

Explores the Simon Problem 4, analyzing quantum states and algorithm complexity.

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.