1
BAHIR DAR UNIVERSITY
BAHIR DAR INSTITUTE OF TECHNOLOGY
FACULTY OF COMPUTING
PROGRAMMING CHAIR
Complexity Theory Course Guidebook
Academic year: 2012 E.C, Semester: I
1. General Information
Course Title Complexity Theory
Course Code CoSc4131 Instructors
Pre-requisite Formal Language and Automata Theory Name Tsegaye A.
Course type Major/Compulsory/common Office No Ghion building
CP/ Cr.hr 5cp Email
[email protected] om
Contact hours Lecture Tutorial Lab H. Study Consultation friday (2:00-6:00 L.T)
hr.
2 3 0 -
Program/Department Year Section Name
Target Group
Computer science IV A Office No -
2. Course Description:
The Complexity Theory course is aimed to make students to grasp the general and basic knowledge of
Turing Machine and construction of Turing Machine, the importance of time and space complexities,
various notations and theorems of Complexity theory.
3. Course Objectives
On completion of this course students should be able to:
Explain Models of Computation, resources (time and space), algorithms, computability, and
complexity.
Understand Complexity classes, P/NP/PSPACE, reductions, hardness, completeness,
hierarchy, relationships between complexity classes.
Learn Randomized computation and complexity; Logical characterizations, incompleteness and
Approximability.
Understand Circuit complexity, lower bounds; Parallel computation and complexity; Counting
problems and Interactive proofs.
Learn Probabilistically checkable proofs; Communication complexity and Quantum computation
4. Course outline with teaching methodology, week and reference:
The following is an outline of the order in which syllabus contents will be covered. The exact dates
and due dates for assignments and exams can be found on the class calendar and are subject to change
with notice.
Weeks Topics References
CHAPTER I: Turing Machine (TM) R1
1, 2 & 3 Standard TM
Construction of TMs
CHAPTER II: Undecidability R1
Turing Decidable
Turing Acceptable
This course guide book format was adopted from BiT Quality Assurance and Enhancement Office 2018 G.C
2
4-7 Undecidable Problems
8 Mid-term Exam
9 - 12 CHAPTER III: Computability R1
Recursive Functions
Recursive Languages
Recursively Enumerable Languages
13 - 15 CHAPTER IV: Computational Complexity R1
Class P versus Class NP
Polynomial Time Reduction and NP-Complete Problems
Cook’s Theorem
16 Final exam
5. Assessment type, weight and duration (Minimum 6 including Mid-exam and Final-exam)
Assessment type Mark allotted Duration
Quiz 1 6% Before Mid
Group Assignment 12% Before Mid
Mid exam 25%
Individual Assignment 11% After Mid
Quiz 2 6% After Mid
Final Exam 40%
Total 100%
6. Course Policy
All students are expected to abide by the code of conduct of students (article 166 and 166.1.1, of the
Senate Legislation of Bahir Dar University May 20, 2005) throughout this course. Academic dishonesty,
including cheating, fabrication, and plagiarism will not be tolerated and will be reported to concerned
bodies for action.
Class attendance and participation: You are expected to attend class regularly. I will take attendance
on regular days during the semester to ensure that students are coming to class, and if you miss class
repeatedly, your grade will be affected as it has value. If you miss more than 85% lecture and tutorial
classes, you will not sit for final exam.
7. Text and reference books
R1. Complexity Theory: A Modern Approach Sanjeev Arora and Boaz Barak
Others
Computability and Complexity Theory (Texts in Computer Science)
by Steven Homer (Author), Alan L. Selman (Author) Publisher: Springer; 1 edition.
Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou.
Computational Complexity. C.H. Papadimitriou.
M. R. Garey & D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-
completeness. The classic work on NP-completeness.
8. Authorization
a. Course instructor’s name: Debas Senshaw.
Signature: ________________ Date: 10/14/2019 G.C
b. Verified chair holder’s Name: Abrham Debasu
Signature: ____________Date: _____________
This course guide book format was adopted from BiT Quality Assurance and Enhancement Office 2018 G.C
