Complexity of Combinatorial Counting

Slides of lectures

1. Lecture of 11.3.2001 (36 slides)
   4 slides/page
   The grand picture

2. Lecture of 18.3.2001 (28 slides)
   4 slides/page
   For the VP and VNP classes cf. Buergisser's Habilitation Thesis, Chapters 1-3.

3. Reading assignment for 25.3.2001 (1 page)
   We shall treat chapter 18 of Papadimitriou's book "Computational Complexity".

4. Lecture of 1.4. 2001 (21 pages)
   4 slides/page
   Computing permanents fast: Cauchy matrices, Borchardt's theorem and the theorem of Carlitz and Levine.

   PESSAH

5. Lecture of 15.4. 2001 (xx pages)
   Shimon Landa will present the proof that the permanent is #P complete (both for (o,1) matrices and integer matrices.

6. Lecture of 22.4. 2001 (xx pages)
   Continuation of previous proof.
   Genrating functions of graph properties.

7. Lecture of 29.4. 2001 (16 pages)
   Introduction to chromatic polynomial, rank generating polynomial and Tutte polynomial. After Bollobas 'Modern Graph Theory', Chapter V and X.

8. Lecture of 3.5. 2001 (xx pages)
   
9. Lecture of 3.6. 2001
   Introduction to tree width (no slides)
10. Still planned:

    The Hamiltonian in fields of characteristic 2. The class $\oplus$-P. Theorem of Zachos/Papadimitriou. Theorem of Kogan.

Back to course homepage.