University home »
Faculty of Science »
Department of Computer Science »
Courses » COMPSCI 750 SC » Lectures »
Computer Science
Lectures: COMPSCI 750 Semester 2, City Campus
The following is merely a guideline.
Michael's part
Andre's part
Top
| Lecture | Topic |
| 1 | Languages and Computational Models (e.g. Turing Machines) |
| 2 | Resource Bounds and Serial Computation Models |
| 3 | Decision Problems and Complexity |
| 5 | Relation Between Time and Space |
| 6 | Complements of Complexity Classes |
| 7 | NP and co-NP |
| 8 | Reductions (Many-one and Turing) |
| 9 | Hard and Complete Problems |
| 10 | NP-complete Problems |
| 11 | Examples of NP-complete Problems |
| 12 | More Examples of NP-complete Problems |
| 13 | Space complexity |
| 14 | Savitch's Theorem (Nondeterministic Space) |
| 15 | PSPACE-complete Problems |
| 16 | L and NL |
| 17 | NL-completeness |
| 18 | NL equals CoNL |
| [ Midterm Exam ] |
-
Space Hierarchy Theorem
Time Hierarchy Theorem
Relativization
Cris Calude's AIT slides with some modifications by Andre Nies
Interactions of computability and randomness (week 12)
Assignment 3
Assignment 4, due Oct 18 4:30pm in Andre's office
Assignment 4 Solutions
-
Related Programmes
