Learning from Probabilistic ModelsDelves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.
Complexity of AlgorithmsExplores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.
Belief propagation simplificationExplores simplifying belief propagation equations for pairwise models, reducing computational complexity from order n cubed to order n.
Elements of Computational ComplexityIntroduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Subset Sum: LLL AlgorithmCovers the Subset Sum problem and the efficient LLL algorithm for finding solutions in lattice basis reduction.
