Max-Flow Min-Cut

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 3 of 3

Density Operator Formalism

Covers the density operator formalism, polynomial time, NP problems, BPP, QMA, and probabilistic algorithms.

Quantum Approximate Optimization Algorithm

Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.

Complexity of Algorithms: Big-O Notation

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Dijkstra's Algorithm: All-Pairs

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

Dynamic Programming: Knapsack

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

Knapsack Problem: Optimization and Traveling Salesman

Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.

Network Flows Meets Simplex

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Theory of Computation: NP Complexity

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

Complexity & Induction: Algorithms & Proofs

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

Understanding Complexity: Tractable Problems and NP-Complete

Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.