Complexity Theory
- Lecturer:
Prof. Dr. Ernst W. Mayr
- Module:
IN2007,
TUMonline
- Area:
4+2 lectures per week in
area III (Theoretical Computer Science)
core course, topic algorithms
- Time and Place:
Tuesday, 08:25–09:55, MI HS 2
Friday, 08:25–09:55, 00.13.009A
-
Exercises
2 hours per week exercises accompanying the lectures
Teaching Assistant: Chris Pinkau
- Exam:
The exam will take place on Th August 2, 2012 from 08:30 to 11:30
The mentioned time is the net process time. Please attend 15 minutes before.
The only permitted aid is an A4-page that contains notes written on both sides by your own hand. (Printers are not allowed.)
- Audience:
graduate students of computer science
students with computer science as minor
- ECTS: 8 Punkte
- Prerequisites:
1st and 2nd year courses
Course Efficient Algorithms and Datastructures I advantageous, but not required.
Course Randomized Algorithms advantageous, but not required.
- Recommended for:
Extended knowledge in complexity theory
- Contents and Literature:
see here.
- Slides:
| April: | April 17, 2012 |
April 20, 2012 |
| April 24, 2012 |
April 27, 2012 |
| May: | | May 4, 2012 |
| May 8, 2012 |
May 11, 2012 |
| May 15. 2012 |
May 18. 2012 |
| May 22, 2012 |
May 25, 2012 |
| June: | | June 1, 2012 |
| |
June 8, 2012 |
| June 12, 2012 |
June 15, 2012 |
| June 19, 2012 |
June 22, 2012 |
| June 26, 2012 |
June 29, 2012 |
| July: | July 3, 2012 |
July 6, 2012 |
| July 10, 2012 |
July 13, 2012 |
| July 17, 2012 |
July 20, 2012 |
And here is everything in one file!
(Hints for using the slides)
- Office Hours:
look here
