CS 6382 (Spring'2011) Theory of Computation
2:30-3:45pm MW, ECSS 2.203

This course consists of five parts:

Theory of Deterministric Computation
Theory of Nondeterministic Computation
Theory of Parallel Computation
Theory of Probabilistic Computation
Theory of Approximate Computation

Contact Information of Professor

Office Hours: Tue 1:30 - 230PM
in Room ECSS 3-611.
homepage: http://www.utdallas.edu/~dxd056000

Teaching Assistants:

Please click here for information on TA

* Jiaofei Zhong

BetID: jxz070100
Office Hours: 3:45pm-5:00pm Tuesday & Thursday or by appointment
in Room ECSS 4.608
Email: fayzhong@utdallas.edu

Syllabus .

Textbook

Ding-Zhu Du and Ker-I Ko:

Theory of Computational Complexity

John-Wiley
ISBN: 0-471-34506-7
Pages: 493
Published: Jan 2000

Errata

Review

Lectures

Part I (Theory of Deterministic Computation)
Lecture 1 Turing Machine (Sec. 1.1-2)
Lecture 2 Time and Space of DTM (Sec.1.2)
Lecture 3 Universal TM and diagonalization (Sec. 1.5-6)
Lecture 4 Hierarchy Theorem

Part II (Theory of Nondeterministic Computation}
Lecture 5 Time and Space of NTM (Sec.1.3-4)
Lecture 6 NP class (Sec. 2.1)
Lecture 7 Cook Theorem (Sec. 2.2)
Lecture 8-9 Proof of NP-hardness (Sec. 2.3-4)
Lecture 10 Proof of NP-hardness (3)
Lecture 11 Polynomial-time Hierachy (Sec. 3.1-2)
Lecture 12-13 Complete Problem in HP (Sec. 3.3)
Lecture 14 Characterization of PSPACE (Sec. 3.4)
Lecture 15 PSPACE-complete (Sec. 3.5)

Part III (Theory of Parallel Computation)
Lecture 16 P-size Circuit (Sec. 6.1-2)
Lecture 17 NC Class (Sec. 6.5)
Lecture 18 Separating NC Hierachy (Sec. 6.6, 6.4)
Lecture 19 P-complete (Sec, 6.7)

Part IV (Theory of Probablistic Computation)
Lecture 20 Random Algorithm (Sec. 8.1)
Lecture 21 Probabilistic TM (Sec. 8.2-4)
Lecture 22 Power of Randomized Algorithms (Sec. 8.5-6)
Lecture 23 Counting Class #P (Sec. 9.1-2)
Lecture 24 #P-complete (Sec. 9.2)

Part V (Theory of Approximate Computation)
Lecture 25 Approximations for NP-hard Problems (Sec. 2.5)
Lecture 26 Reduction with Gap (Sec. 2.5)
Lecture 27 APX-complete (Sec. 11.5)
Lecture 28 PCP Theorems
Lecture 29 Set-Cover and Indepedent Set (Sec. 11.5)
Final Exam

Homeworks and Examinations

Among the following 5 homeworks, there are only 4 will be graded as follows:

Homework One due on 2/7 (Extend to 2/14.).
A special office hour will be held at 2-3 pm on 2/13 (Sunday) in room 3-611.
Homework Two due on 2/28.
A special office hour will be held at 10:30-11:30 am on 2/27 (Sunday) in room 3-611.
Homework Three due on 3/21 (extended to 4/11).
(Note: Remove Problem 3 and read this reference for Problem 5.
Assume the game in the reference is PSPACE-complete. Then solve Problem 5.)
A special office hour will be held at 10:30-11:30 am on 4/10 (Sunday) in room 3-611.
Homework four due on 4/11 (extended to 4/25).
A special office hour will be held at 10:30-11:30 am on 4/24 (Sunday) in room 3-611.
Homework five due on 4/25.

Please note:
(1) All homework will be collected at the begining of class. NO LATE HOMEWORK will be accepted.
(2)You are encouraged to discuss with your classmates for homeworks.

There are two exams (open book and .ppt):

The 1st Midterm on 3/2
Final Exam on 5/2

Each assignment 10%, Midterm 30%, Final 30%.
Grades will be assigned according to the total number of received points:
A >= 85 > B >= 70 > C >= 50.