Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)

Martin Grohe, Michal Koucky, Rüdiger Reischik & Dieter Van Melkebeek
This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complexity of Discrete Problems''. The first section gives an overview of the topics covered and the organization of the meeting. Section~2 lists the talks given in chronological order. The last section contains the abstracts of the talks.