LEA

Complexity Theory

News

Course

  • 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:
    Monday, 14:15–16:00, 00.08.038
    Thursday, 14:00(!!)–15:45, 00.08.038
  • Exercises:
    2 hours per week exercises accompanying the lectures
    Tuesday, 12:15–13:45, MI 03.11.018
    Teaching Assistant: Chris Pinkau
  • Exam:
    The final exam will take place on Mo July 27, 2015 from 08:30 to 11:30 in room MW 0350. The times given represent the net examination 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
    Module IN2003: Efficient Algorithms and Datastructures I advantageous, but not required
    Module IN2160: Course Randomized Algorithms advantageous, but not required.
  • Recommended for:
    Extended knowledge in complexity theory
  • Office Hours:
    see here

Course Contents and Literature

see here.

Slides

April: April 13, 2015 April 16, 2015
April 20, 2015 April 23, 2015
April 27, 2015 April 30, 2015
May: May 4, 2015 May 7, 2015
May 11, 2015
May 18, 2015 May 21, 2015
May 28, 2015
June: June 1, 2015
June 8, 2015 June 11, 2015
June 15, 2015 June 18, 2015
June 22, 2015 June 25, 2015
June 29, 2015
July: July 2, 2015
July 6, 2015 July 9, 2015
July 13, 2015 July 16, 2015
And here is everything in one file! 
(Hints for using the slides)