Scribd
Upload
16 views1 page

Complexity Theory Syllabus

The document outlines the course details for 'Complexity Theory' at the Indian Institute of Technology Roorkee, including prerequisites, objectives, and content structure. It covers topics such as computability, time and space complexity, polynomial hierarchy, circuits, and randomized computation over 42 contact hours. Suggested readings include notable textbooks on complexity theory from various authors.

Uploaded by

rajat835
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views1 page

Complexity Theory Syllabus

The document outlines the course details for 'Complexity Theory' at the Indian Institute of Technology Roorkee, including prerequisites, objectives, and content structure. It covers topics such as computability, time and space complexity, polynomial hierarchy, circuits, and randomized computation over 42 contact hours. Suggested readings include notable textbooks on complexity theory from various authors.

Uploaded by

rajat835
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPT./CENTRE: Computer Science and Engineering


1. Subject Code: CSN5XX Course Title: Complexity Theory
2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 25-30 PRS: 0 MTE: 25-35 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Autumn/Spring 7. Subject Area: PEC
8. Pre-requisite: Theory of Computation, Design and analysis of Algorithms
9. Objective: The intended learning outcomes of the course are as follows:
a) Understanding the limitations of computation
b) Learning various complexity classes and relation between them
c) Learning various computation models
10. Details of the Course:
Sl. Contents Contact
No. Hours
1. Computability: Review of Turing Machine (TM) and its variants, Universal Turing 6
Machines and encoding of Turing machines, Uncomputability
2. Time Complexity: Complexity Classes P and NP, P vs NP, Reducibility, NP- 8
completeness, The Cook-Levin theorem
3. Diagonalization: Time-hierarchy theorem, Ladner’s theorem, Limits of diagonalization 3
4. Space Complexity: Space bounded computation, Complexity classes: L, NL and 7
PSPACE, NL-completeness, PSPACE-completeness, Space hierarch theorem, Savitch’s
theorem, Immerman-Szelepscenyi theorem
5. Polynomial Hierarchy: The Polynomial Hierarchy, Alternating Turing machines, 4
Time-Space Tradeoffs for SAT
6. Circuits: Boolean Circuits and the Class P/poly, Uniformly generated circuits, Turing 7
machines that take advice, Karp-Lipton Theorem, Circuit Lower Bounds, Complexity
Classes NC and AC.
7. Randomized Computation: Probabilistic Turing machines, One-sided and two sided 7
errors: complexity classes RP, coRP and ZPP, Error-reduction in randomized
computation, Sipser-Gacs theorem, Randomized space-bounded computation.
Total 42

11. Suggested Books/Reading:


Sl. Year of
Name of Books / Authors
No. Publication
1. S. Arora and B. Barak, Complexity Theory: A Modern Approach, First Edition 2009
Cambridge University Press
2. Oded Goldreich, Computational Complexity: A Conceptual Perspective, First Edition, 2008
Cambridge University Press
3. Christos H. Papadimitriou, Computational Complexity, First Edition, Addison-Wesley 1994

4. Michael Sipser, Introduction to the Theory of Computation, Third Edition, Cengage 2014
India Private Limited

You might also like