Lectures related to Theory of Computation: NP Problems Examples

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

Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.

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

Covers Promise Constraint Satisfaction Problems complexity, width, graph coloring, polymorphisms, and algorithms.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Explores countability and undecidable problems in the theory of computation.

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.