Course catalogue
Overview > Faculty of Mathematics, Informatics and Natural Sciences > Department of Informatics > C. Bachelor of Science Information Systems > Required Elective Area > Required Elective Area Mathematics/Theory > Modul InfB-BKA: Berechenbarkeit, Komplexität und Approximation (Studienstart ab WS 2019/20)
Course offerings / Modules
|
Course offering / Module Instructors / Module Owner Time period |
Event type Room |
|||
|---|---|---|---|---|
|
64-074 Lecture Computability, Complexity and Approximation Prof. Dr. Petra Berenbrink Tue, 12. Apr. 2022 [16:15] - Tue, 12. Jul. 2022 [18:45] |
Lecture | |||
|
64-075 Exercises Computability, Complexity and Approximation Prof. Dr. Petra Berenbrink; Felix Biermeier; Christoph Damerius; Tim Christopher Hahn |
Practical course/lab | |||