The aim of this course is to present an up-to-date introduction to propositional proof complexity with emphasis on game-theoretic techniques, connections to parameterized complexity and DPLL algorithms. We will cover important proof systems, current knowledge about proof lengths in these systems, and implications for the performance of satisfiability algorithms.
News
- ESSLLI Evaluation
- ESSLLI on VideoLectures.NET
- ESSLLI Photos
- ESSLLI Closing Ceremony, Friday, 12 August 2011 @ 4 pm, Peterlin Pavillion
- ESSLLI OFFICE CLOSING TIME
- ESSLLI Photos
- Tonight’s Evening Lecture
- Student Session Poster Presentations, Thursday 15:45-16:45
- Evening Lecture tonight
- Last Call for THE Traditional ESSLLI Soccer Match: Lecturers vs. Students
- FoLLI General Meeting: Beth Prize presentation
- Football (rules)
- ESSLLI bags and T-Shirts have arrived
- ESSLLI Excursions (final)
- Formal Grammar, FOLLI meeting, Logical constants
