Nicola Galesi

Teaching

PhD

2014
Great Ideas in CS - Razborov-Smolensky lower bound (Sapienza)

2014
Lectio Magistralis - Logic Summer School (Lago di Garda)

2013
Great Ideas in CS - Razborov-Smolensky lower bound (Sapienza)

2009
Introduction to Proof Complexity (UniversitÓ di Salerno)

2003
Complexity Theory (Universitat Politecnica de Catalunya)

2002
Introduction to Proof Complexity (Universitat Politecnica de Catalunya)

Master and Bachelor

Info and Material about recent courses can be found at the  G+ page
2016-2017
Modeling and Optimization (I sem)
Computational Complexity (I sem)
Automata, Computability and Complexity (Sapienza online)

2015-2016
Modeling and Optimization (II sem)
Computational Intractability (II sem)

2014-2015
Modeling and Optimization (I sem )
Computational Intractability (I sem)
School Teacher Training (TFA) - Algorithms

2013-2014
Modeling and Optimization (I sem )
Theory of Computing (I sem)

2012-2013
Modeling and Optimization (I sem )
Theory of Computing (I sem)

2006-2011 (Sapienza)
Theory of Computing, Introduction to Programming, Advanced Programming, Algorithms and Data Structures, Algorithmic Programming Contest,  Programming Lab.

2001-2005 (Universitat Politecnica Catalunya)
Introduction to Programming, Introduction to Logic, Data Bases, Algorithmic and Data Structures