Explores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.
Covers the rod cutting problem and the change-making problem to optimize recursive calls and find the minimum number of coins needed for a given amount of money.
Explores optimizing recursive queries in database systems using Datalog and semirings, discussing the challenges and solutions in data analytics.
Covers optimization methods, focusing on gradient methods and line search techniques.
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
