Logic List Mailing Archive

COMBSTRU School on Computational Complexity: Bertinoro (Italy), May 2006

The COMBSTRU School on Computational Complexity is a forum for advanced
training of pre- and post-docs on hot topics in Computer Science at the
frontier of current research trends. Such a school is held for the first
time in Italy and is an opportunity for young researchers in Computer
Science, Economics and Applied Mathematics to meet with research leaders
in the areas of Computational Economics and Complexity Theory.

The Combstru School in Computational Complexity will take place in the
Italian hill-town of Bertinoro (http://www.centrocongressibertinoro.it/)
on May 2-8, 2006.

Prof. Bruno Codenotti will give a course in "Equilibrium Problems:  
algorithms, computational complexity and application".

Prof. Pavel Pudlak will give a course in "Circuit complexity and
propositional calculus - lower bound methods".

The school is open to Ph.D. students and post-docs in Computer Science,
Economics, and Applied Mathematics.

The number of students accepted is limited to 30. A limited number of
fellowships for citizens of the EU and Associated States is available.  
For details visit the school web site http://www.iit.cnr.it/cscc06/.

Syllabus:

Bruno Codenotti - Equilibrium Problems: Algorithms, Computational 
Complexity, and Applications

Pavel Pudlak - Circuit complexity and propositional calculus, lower bound 
methods