Undergraduate Course: Computational Complexity (INFR11102)
|School||School of Informatics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 11 (Year 4 Undergraduate)
||Availability||Available to all students
|Summary||This module studies the problem of classifying computational problems according to their intrinsic difficulty or 'complexity'. We begin by defining a standard computational model, the Turing machine, which is useful for abstracting out complexity aspects of computational problems. We define various complexity resources, such as time, space, non-determinism , randomness and non-uniformity, and learn how to classify computational problems according to their resource requirements. Among other topics, we discuss the central problem of theoretical computer science, the P vs NP problem, and explain its importance using the notions of reductions and completeness.
* The computational model: Turing machines
* NP and NP completeness
* Space complexity
* The polynomial hierarchy and alternations
* Randomized computation
* Hardness of approximation and the PCP theorem
Relevant QAA Computing Curriculum Sections: Concurrency and Parallelism, Data Structures and Algorithms, Theoretical Computing
Entry Requirements (not applicable to Visiting Students)
||Other requirements|| This course is open to all Informatics students including those on joint degrees. For external students where this course is not listed in your DPT, please seek special permission from the course organiser.
Participants should have some facility with mathematical modes of reasoning.
Information for Visiting Students
|High Demand Course?
Course Delivery Information
|Academic year 2017/18, Available to all students (SV1)
|Learning and Teaching activities (Further Info)
Lecture Hours 20,
Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (Assessment)
||Three collections of pencil-and-paper exercises issued at approximately three-week intervals.
You should expect to spend approximately 25 hours on the coursework for this course.
If delivered in semester 1, this course will have an option for semester 1 only visiting undergraduate students, providing assessment prior to the end of the calendar year.
|No Exam Information
On completion of this course, the student will be able to:
- Students will be able to formulate computational models with resource constraints, and be able to describe relationships between these models.
- Students will be able to analyse computational problems from a complexity perspective, and so locate them within the complexity landscape.
- Students will be able to apply mathematical skills and knowledge from earlier years (eg., from logic and discrete mathematics) to concrete problems in computational complexity.
- Students will gain an appreciation of the broader importance of fundamental problems in computer science, such as the P vs NP problem.
|1. Sanjeev Arora and Boaz Barak, 'Computational Complexity: A Modern Approach', Cambridge University|
Press, 2009. Required
2. Michael Sipser, 'Introduction to the Theory of Computation', PWS, 1997. Background reading
3. Christos Papadimitriou, 'Computational Complexity', Addison-Wesley, 1994. Supplementary reading
4. Uwe Schoening, 'Gems of Theoretical Computer Science', Springer Verlag, 1998. Supplementary
|Course organiser||Dr Heng Guo
Tel: (0131 6)51 3175
|Course secretary||Mr Gregor Hall
Tel: (0131 6)50 5194