CSC 2429: Propositional Proof Complexity
Fall, 2002

Students should consult this page at least once a week for important information.

Lectures: Thursday 10-12 Walberg 119

Instructor: Toniann Pitassi, email: toni@cs
Office: Sandford Fleming 2305A, 978-3695
Office Hours: by appointment

Course Information Sheet

HOMEWORK

PAPERS AND OTHER REFERENCES

SCRIBE NOTES

***NOTE*** THESE ARE ROUGH DRAFTS AND ARE LIKELY TO CONTAIN ERRORS

  • Sample scribe notes
  • Lecture 1
  • Lecture 2
  • Lecture 3
  • Lecture 4
  • Lecture 5
  • Lecture 6
  • Lecture 7
  • Lecture 8
  • Lecture 9
  • Lecture 10
  • Lecture 11
  • Lecture 12

    MY HANDWRITTEN SLIDES

  • Hardness of Minimum Proof Length for Resolution

    PAUL BEAME'S IAS SLIDES

  • Intro Lecture
  • Resolution Lower Bounds, and related work
  • Automatizability and Interpolation
  • Restriction method and bounded depth Frege
  • Open Problems