Browse Hierarchy ECS651U: Computability, Complexity and Algorithms

Back to EM-EECS-COMP: Department of Computer Science
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.

Sorry, there are no lists here yet. You could try:

  • Clicking My Lists from the menu. Your course enrolled lists are stored here.
  • Searching for the list using the form below:

Lists linked to Computability, Complexity and Algorithms

There are currently no lists linked to this Module.