Computability, Complexity and Algorithms

Module code: ECS651U

Credits: 15.0
Semester: SEM1

Contact: Dr Soren Riis

A theoretical course, which concerned with the theoretical core of Computer Science. The course covers some of the most successful algorithms as well as some of the most central decision problems. A large part of the course will focus on the NP versus P problem as well as other famous unsolved problem in Computer Science. To understand this problem we consider the issue of how one programming problem can be disguised as another apparently very different problem. This idea is very important in designing algorithms and plays a crucial role in the theory of NP-completeness.

Connected course(s): UDF DATA
Assessment: 80.0% Examination, 20.0% Coursework
Level: 6