Computational Complexity: Theory and Applications

Related lectures (29)

Page 2 of 3

Covers classical and quantum computational complexity concepts and implications.

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

Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.

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

Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.

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

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.

Explores quantifier elimination steps for Presburger Arithmetic, emphasizing techniques to simplify and eliminate quantifiers efficiently.

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