Argomenti del programma: Recursion and dynamic programming (20h) - Introduction to graph theory, Trees and data structures, Algorithms on graphs (20h) - Algorithmic complexity, polynomial reductions and NP-completeness (15h) - Information theory and statistical inference: maximum entropy, maximum likelihood and Boltzmann learning, Belief Propagation and inference on trees, Inference of Trees: Chow-Liu theorem, Expectation Propagation,…
Testi d'esame di Algorithms For Optimization, Inference And Learning del prof. Alfredo Braunstein, canale unico, corso di laurea in Physics of Complex Systems (Fisica dei Sistemi Complessi) (Laurea magistrale (LM-44)), Politecnico di Torino, 1º anno · 2º semestre · 8 CFU, a.a. 2026/2027. Libri adottati: Introduction to Algorithms, T.H. Cormen, C.E. Leiserson, R.L.; Computer and Intractability. A Guide to NP-Completeness. M.; Information Theory – Information Theory, Inference, and Learning Algorithms; The nature of computation. C. Moore, S. Mertens.; Information – Physics and Computation; Biological Sequence Analysis, Durbin, Eddy, Krogh, Mitchison, Cambridge.
Libri Universitari