Lectures related to Theory of Computation: Conclusions and Complexity Theory

Statistical Physics: Spin Glasses & Optimization

Explores the Curie-Weiss model, spin glasses, and optimization problems in statistical physics.

Covers the basics of computational complexity, including big O notation and complexity classes.

Cryptanalysis: Public-Key & The Power of Interaction

Explores cryptanalysis in public-key systems and the power of interaction in interactive proofs, covering CO-NP, NP classes, P vs. NP, and more.

Theory of Computation: Complexity of Problems

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Berni Alder Prize: Celebrating 50 Years of CECAM

Commemorates 50 years of CECAM and the Berni J. Alder CECAM Prize, covering milestones in computational methods, quantum mechanics, slip motion, and more.

Promise Constraint Satisfaction and Width

Covers Promise Constraint Satisfaction Problems complexity, width, graph coloring, polymorphisms, and algorithms.