Main Field of Study and progress level:
Computing Science: Second cycle, has only first-cycle course/s as entry requirements
Grading scale: TH teknisk betygsskala
Responsible department: Department of Computing Science
Contents
Being one of the major areas of theoretical computer science, computational complexity asks why certain problems require more resources than others if we want to solve them algorithmically. Upon successful completion of the course, students will have acquired knowledge regarding
the most important complexity measures, namely time and space, and the major complexity classes these give rise to, central algorithmic techniques, and major results of the theory including their proofs.
Required Knowledge
Univ:To be addmitted you must have 60 ECTS-credits in Computing Science or 2 years of completed studies, in both cases including Fundamentals of Computer Science 7,5 ECTS, (5DV037), Data Structures and Algorithms 7,5 ECTS, (5DV043). Logic for Computer Scientists, (5DV007) and Discrete Mathematics 7,5 ECTS, (5MA006) or equivalent.
English proficiency equivalent to IELTS Academic Training minimum score 5.0 with no individual score below 4.5 (Tests taken before January 2005 not admissible or TOEFL minimum score 500 on paper based test and not below 4.0 on the TWE, Alternatively 173 on computer based test with iBT61 is also required as well as basic entrance requirements for higher studies in Swedish language proficiency if the course in taught in Swedish.
English proficiency equivalent to IELTS Academic Training minimum score 5.0 with no individual score below 4.5 (Tests taken before January 2005 not admissible or TOEFL minimum score 500 on paper based test and not below 4.0 on the TWE, Alternatively 173 on computer based test with iBT61 is also required as well as basic entrance requirements for higher studies in Swedish language proficiency if the course is taught in Swedish.
Literature
The literature list is not available through the web.
Please contact the faculty.
