Elements of computational complexity

Related lectures (28)

Covers Shor's factoring algorithm and the link between order finding and factoring.

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Covers Grover's search algorithm, a quantum algorithm for searching unstructured databases.

Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.

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 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.

Page 2 of 2