CSC 8510: Lecture Notes

Printable versions:

Introduction (Chapter 0)

Regular Languages (Chapter 1)

Context-Free Languages (Chapter 2)

The Church-Turing Thesis (Chapter 3)

Decidability (Chapter 4)

Reducibility (Chapter 5) 

Measuring Complexity (Section 7.1)

The Class P (Section 7.2) 

The Class NP (Section 7.3) 

NP-Completeness (Section 7.4)

Additional NP-Complete Problems (Section 7.5) 

Space Complexity (Section 8.0)

Savitch's Theorem (Section 8.1)

The Class PSPACE (Section 8.2) 

PSPACE-Completeness (Section 8.3) 

The Classes L and NL (Section 8.4)

NL-Completeness (Section 8.5) 

NL Equals coNL (Section 8.6)

Hierarchy Theorems (Section 9.1)

Relativization (Section 9.2)

Circuit Complexity (Section 9.3)

Approximation Algorithms (Section 10.1)

Probabilistic Algorithms (Section 10.2)

Alternation (Section 10.3)

Interactive Proof Systems (Section 10.4)

Parallel Computation (Section 10.5)

Full (animated) versions

Introduction (Chapter 0)

Regular Languages (Chapter 1)

Context-Free Languages (Chapter 2)

The Church-Turing Thesis (Chapter 3)

Decidability (Chapter 4)

Reducibility (Chapter 5) 

Measuring Complexity (Section 7.1)

The Class P (Section 7.2) 

The Class NP (Section 7.3) 

NP-Completeness (Section 7.4)

Additional NP-Complete Problems (Section 7.5) 

Space Complexity (Section 8.0)

Savitch's Theorem (Section 8.1)

The Class PSPACE (Section 8.2) 

PSPACE-Completeness (Section 8.3) 

The Classes L and NL (Section 8.4)

NL-Completeness (Section 8.5) 

NL Equals coNL (Section 8.6)

Hierarchy Theorems (Section 9.1)

Relativization (Section 9.2)

Circuit Complexity (Section 9.3)

Approximation Algorithms (Section 10.1)

Probabilistic Algorithms (Section 10.2)

Alternation (Section 10.3)

Interactive Proof Systems (Section 10.4)

Parallel Computation (Section 10.5)