LEA

Complexity Theory

News

    See below for the date of the (oral) makeup exam!

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, 08:15–10:00, 00.13.009A
    Thursday, 10:15–12:00, MI HS 3
  • Exercises:
    2 hours per week exercises accompanying the lectures
    Thursday, 12:30–14:00, MI 03.11.018
    Teaching Assistant: Chris Pinkau
  • Exam:
    The final exam will take place on Mo July 21, 2014 from 14:30 to 17:00 in room MI HS2.
    Makeup exam (oral): Fri, Oct 10. 2014, from 13:00, MI 03.09.054
    If you want to take the makeup exam, register on TUMonline by Sep 15!
    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
    Course Efficient Algorithms and Datastructures I advantageous, but not required.
    Course Randomized Algorithms advantageous, but not required.
  • Recommended for:
    Extended knowledge in complexity theory
  • Office Hours:
    look here

Course Contents and Literature

see here.

Slides