Reformulating Problems: Tools and Intuition

Related lectures (30)

Page 2 of 3

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.

Explores linear algebra concepts, mappings between sets, unique element matches, and reciprocal functions.

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

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Covers the fundamentals of spectroscopy, including tools and techniques used for internal conversion and vibrational relaxation.

Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.

Covers graphical models for probability distributions and factor graphs representation.

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.