Lectures related to Coin Rendering: Part 1

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

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

Tower of Hanoi: Recursion and Dynamic Programming

Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.

Strategies to Break Linear Scaling Relationships in Catalysis

Explores breaking linear scaling relationships in catalysis through strategies like controlling ensembles, using ligands, and introducing complexities to enhance performance.

Cutset Formulation: MST Problem

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.