__Tutorial talks:__

** Samuel R. Buss
"Proof Complexity and Computational Hardness''.
Transparencies for three tutorial lectures.
Conference on Computability in Europe (CiE), held June-July
2006.
Talks given July 3, July 4 and July 5, 2006.**

** Download: postscript or
PDF.
**

** Abstract: **

** Day 1: Proof Complexity
and Feasible Computation Classes.** Introduction to
proof complexity. Cook's program for P versus NP.
Automatizability. Hardness of automatizability based on hardness of
factoring Blum integers. Craig interpolation.