250102 VO Introduction to theoretical computer science (2013W)
Labels
Details
Language: German
Examination dates
Lecturers
Classes
Currently no class schedule is known.
Information
Aims, contents and method of the course
The course offers an introduction to computational complexity theory centered around the P versus NP problem. Basic knowledge in mathematical logic is assumed.
Assessment and permitted materials
Oral examination
Minimum requirements and assessment criteria
Examination topics
Reading list
Arora, Barak, Computational Complexity - A Modern Approach, Cambridge University Press, 2009.Papadimitriou, Computational Complexity, Addison Wesley, 1994.
Association in the course directory
MLOI
Last modified: We 19.08.2020 08:05