Lectures Fundamentals of Algorithms and Data Structures Efficient Algorithms and
Data Structures II Complexity Theory Proseminar Graph Drawing Seminar / Master Seminar Approximation-Algorithms Lab Course Discrete Optimization Courses for PhD Students Oberseminar

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 1, 2013 from 11:30 to 14:00 in room Interims Hörsaal 101.
  The times given represent the net process time. Please attend 15 minutes before.
  The only aid permitted is an A4-page (two sides) containing notes handwritten by yourself (no printer output).
• 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 16, 2013	April 19, 2013
  	April 23, 2013	April 26, 2013
  	April 30. 2013
  May:		May 3, 2013
  	May 07, 2013 (cncl'd)	May 10, 2013
  	May 14. 2013	May 17. 2013
  		May 24, 2013
  	May 28, 2013	May 31, 2013
  June:	June 04, 2013	June 07, 2013
  	June 11, 2013	June 14, 2013
  	June 18, 2013	June 21, 2013
  	June 25, 2013	June 28, 2013
  July:	July 02, 2013	July 05, 2013
  	July 09, 2013	July 12, 2013
  	July 16, 2013	July 19, 2013

  And here is everything in one file! 
  (Hints for using the slides)
  
• Office Hours:
  look here