181.142 Complexity theory
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2011S, VU, 2.0h, 3.0EC, to be held in blocked form

Properties

  • Semester hours: 2.0
  • Credits: 3.0
  • Type: VU Lecture and Exercise

Aim of course

Introduction to Complexity Theory: Understanding of basic notions, concepts, methods, and results.

Subject of course

Basic notions of complexity theory, deterministic und non-deterministic complextiy classes, NP-complete problems, logarithmic space, the polynomal hierarchy, exponentially hard probleme, applications. Didactical Concept: *) The contents is presented by the course instructor. *) Interaction: The students are asked questions to stimulate the ability to think for themselves. On the other hand, students are encouraged to contribute to the lecture by questions/comments. *) Homework assignments allow the students to practice the methods taught in the lecture (in particular, "clean" mathematical proofs of complexity results). *) Reading assignments allow the students to read themselves more on related/advanced topics. Assessment: is based on homework/reading assignments as well as a written exam.

Additional information

registration via TISS

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Tue11:00 - 13:0001.03.2011 - 30.06.2011Seminarraum FAV EG C (Seminarraum Gödel)
Thu16:00 - 19:0010.03.2011GM 2 Radinger Hörsaal - TCH x
Complexity theory - Single appointments
DayDateTimeLocationDescription
Tue01.03.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue08.03.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Thu10.03.201116:00 - 19:00GM 2 Radinger Hörsaal - TCH x
Tue15.03.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue22.03.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue29.03.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue05.04.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue12.04.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue03.05.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue10.05.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue17.05.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue24.05.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue31.05.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue07.06.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue21.06.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Tue28.06.201111:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel)
Course is held blocked

Course registration

Begin End Deregistration end
15.02.2011 00:00 02.03.2011 23:55 15.03.2011 23:55

Registration modalities

aktuelle Infos bitte LVA abonnieren Ort: TISS

Curricula

Literature

C. Papadimitriou. "Computational Complexity". Addison-Wesley, 1994. M. R. Garey and D. S. Johnson. "Computers and Intractability". Freeman, 1979.

Previous knowledge

*) Students are assumed to have a basic knowledge in mathematical logic and to be familiar with basic concepts of complexity theory (to the extent taught in the course "Formale Methoden der Informatik"). *) Moreover, students should have basic mathematical skills (like carrying out proofs by induction) as taught in the mathematics courses in the bachelor studies.

Miscellaneous

Language

English