Lectures related to Dijkstra's Algorithm: All-Pairs

Covers the basics of computational complexity, including big O notation and complexity classes.

Covers counting distinct elements using hash functions and the median trick.

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

Covers classical and quantum computational complexity concepts and implications.

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

Explores the complexity of linear algebra operations and optimization methods, including Gaussian elimination and the simplex method.

Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.

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