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.

2019W, VU, 2.0h, 3.0EC, to be held in blocked form

Properties

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

Learning outcomes

After successful completion of the course, students are able to

  • explain fundamental complexity classes and their intuition
  • carry out complexity analyses of problems (in particular in the Polynomial Hierarchie)

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.

Teaching methods

The material is presented by the lecturer. The students have to solve exercises.

Mode of examination

Immanent

Additional information

ECTS Breakdown

  2 h quiz 
30 h lecture (12 classes including preparation)
40 h exam preparation
3 h written + oral exam
-----------------------------------------------------------
75 h = 3 Ects

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Tue11:00 - 13:0008.10.2019 - 17.12.2019Seminarraum FAV EG C (Seminarraum Gödel) lecture
Thu09:00 - 11:0010.10.2019 - 17.10.2019EI 5 Hochenegg HS entrance exam
Mon11:00 - 13:0021.10.2019 - 16.12.2019Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Complexity theory - Single appointments
DayDateTimeLocationDescription
Tue08.10.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Thu10.10.201909:00 - 11:00EI 5 Hochenegg HS entrance exam
Tue15.10.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Thu17.10.201909:00 - 11:00EI 5 Hochenegg HS entrance exam
Mon21.10.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue22.10.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Mon04.11.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue05.11.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Mon18.11.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue19.11.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Mon25.11.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue26.11.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Mon02.12.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue03.12.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Mon09.12.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue10.12.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Mon16.12.201911:00 - 13:00Seminarraum FAV 01 B (Seminarraum 187/2) lecture
Tue17.12.201911:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) lecture
Course is held blocked

Examination modalities

Assessment consists of 3 components:

  • entrance test
  • exercises
  • written and/or oral exam at the end (details to be announced in the first class)

 

Course registration

Begin End Deregistration end
01.09.2019 00:00 06.10.2019 23:55 20.10.2019 23:55

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