Computational complexity is a field from theoretical computer science concerned with the study of computational problems and organises them in various classes corresponding to the amount of resources (like time or memory) that are needed to solve the problems.
The course will cover the core material from this discipline, such as the important complexity classes (including, but not limited to, P and NP), as well as the classical results relating these classes.
Performance accreditation:
m1865-2023 - Complexity Theory<ul><li>p1865-2023 - Complexity Theory: Klausur schriftlich</li><li>sl1865-2023 - Voluntary Course Work Complexity Theory - Exercises: Excercises</li></ul>
Ahmed, Taha (2024). Development of an iterative multi-agent coordination framework for congestion prevention in low voltage grids.
Busch, Marcel (2024). Entwicklung eines Netzmodells zur szenarienbasierten Untersuchung von Engpässen in heutigen und zukünftigen städtischen Verteilnetzen.
Lindner, Joost (2024). Entwicklung einer probabilistischen Lastprognose für die Niederspannungsebene elektrischer Verteilnetze.
Ming, Zhao (2024). Conceptual Design for a grid demonstrator for teaching purposes and development of a suitable distribution grid simulation.
Wilke, Jan Jakob (2024). Definition leistungsbasierter Netzregeln zur Engpassvermeidung in elektrischen Verteilnetzen.
beendete
2023
Kock am Brink, Jonas (2023). Entwicklung einer Engpassprognose für elektrische Verteilnetze mittels probabilistischer Verfahren.