COURSE DETAIL
COMPUTABILITY, COMPLEXITY, AND ALGORITHMS
Country
UNITED KINGDOM - ENGLAND
Host Institution
University of London, Queen Mary
Program(s)
University of London, Queen Mary
UCEAP Course Level
Upper Division
UCEAP Subject Area(s)
Computer Science
UCEAP Course Number
127
UCEAP Course Suffix
UCEAP Official Title
COMPUTABILITY, COMPLEXITY, AND ALGORITHMS
UCEAP Transcript Title
COMP & ALGORITHMS
UCEAP Quarter Units
6.00
UCEAP Semester Units
4.00
Course Description
This course takes a theoretical approach to 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 focuses on the NP versus P problem, as well as other famous unsolved problems in computer science.
Language(s) of Instruction
English
Host Institution Course Number
ECS651U
Host Institution Course Title
COMPUTABILITY, COMPLEXITY, AND ALGORITHMS
Host Institution Campus
Queen Mary University of London
Host Institution Faculty
Host Institution Degree
Host Institution Department
School of Electronic Engineering and Computer Science