Complexity Theory - Modultafeln of TU Ilmenau
The Modultafeln have a pure informational character. The legally binding information can be found in the corresponding Studienplan and Modulhandbuch, which are served on the pages of the course offers. Please also pay attention to this legal advice (german only). Information on place and time of the actual lectures is served in the Vorlesungsverzeichnis.
| subject properties subject number 101053 - common information | |
|---|---|
| subject number | 101053 |
| department | Department of Mathematics and Natural Sciences |
| ID of group | 2417 (Group for Combinatorics / Graph Theory) |
| subject leader | Prof. Dr. Michael Stiebitz |
| language | Deutsch, bei Nachfrage English |
| term | Sommersemester |
| previous knowledge and experience | Lienera Algebra 1, Graphen und Algorithmen |
| learning outcome | Die Studierenden kennen und beherrschen die gundlegenden Begriffe, Definitionen, Schlussweisen, Methoden und Aussagen der Komplexitätstheorie. |
| content | Grundlegende Konzepte der Komplexitätstheorie: Formale Entscheidungsprobleme und Turingmaschinen, Komplexitätsklassen P und NP, Polynomialzeitreduktion, NP-vollständige Entscheidungsprobleme, Der Satz von Cook. |
| media of instruction | Tafel, Folien, Beamer, Skripte |
| literature / references | Garey and Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness |
| evaluation of teaching | Pflichtevaluation: SS 2016 (Fach) Freiwillige Evaluation: Hospitation: |
| Details in major Bachelor Mathematik 2013, Master Mathematik und Wirtschaftsmathematik 2013 (AM), Master Mathematik und Wirtschaftsmathematik 2013 (WM) | |
|---|---|
| subject name | Complexity Theory |
| examination number | 2400580 |
| credit points | 4 |
| on-campus program (h) | 34 |
| self-study (h) | 86 |
| Obligation | obligatory elective |
| exam | oral examination performance, 30 minutes |
| details of the certificate | werden bei Bedarf festgelet |
| maximum number of participants | |