This course is part of the Master's Programs in Mathematics and Computer Science. Basic knowledge in combinatorial optimization is required.
Chip design is one of the most interesting application areas of mathematics. We discuss theory and practice. Many applications of combinatorial optimization will be shown. Recent theory, algorithms, and implications of new chip technology will be discussed. The course covers topics in Boolean circuit optimization, placement, timing optimization, and routing.
This course is in English. Since there exists no suitable textbook yet, I will distribute lecture notes. Many topics and references can also be found in:
|Class Hours:||Tuesdays and Thursdays, 12:15-13:45, starting April 10.|
|Room:||Gerhard-Konow-Hörsaal (in the Arithmeum building, Lennéstr. 2)|
|Exercise Classes:||Thursdays, 16:00 - 17:30, Seminarraum, Tilmann Bihler; see here|
Prof. Dr. S. Held