CMSC 652: Complexity Theory

SPRING 2014 HOMEPAGE

The Syllabus is in two parts:

- Content of Course:
- Policy for the course:
- Travelling Salesman Movie Info: Advice: See the trailor, but not the movie.

Notes on Turing Machines and P

LATEX SOURCE CODE FOR Notes on Turing Machines and P

Notes on P, NP, Cooks Theorem, Poly Hiearchy1

LATEX SOURCE CODE FOR Notes on P, NP, Cooks Theorem, Poly Hiearchy1

Ladner's Theorem (NOTE- this is a simplification of parts of a paper by Downey and Fortnow, written by Fortnow. The original paper is Here and is NOT required reading.)

LATEX SOURCE CODE FOR Time and Space Classes

LATEX SOURCE CODE FOR Natural problem NOT in P

Sparse Set proof using intervals

LATEX SOURCE CODE FOR Sparse Set proof using intervals-source

LATEX SOURCE CODE FOR Sparse Set proof using chains

LATEX SOURCE CODE FOR Sparse Set and 2tt reductions

LATEX SOURCE CODE FOR Sparse Sets and T-reductions

LATEX SOURCE CODE FOR Relatized classes

Blog about History of Savitch's Theorem

LATEX SOURCE CODE FOR Odd number of assignments

LATEX SOURCE CODE FOR If GI is NPC...

NP subseteq coNP/poly implies...

LaTeX SOURCE CODE FOR NP subseteq coNP/poly implies...

NP subseteq coNP/poly implies MORE STUFF (Still working on it)

Turan's Theorem and Lower Bounds on Finding Max

Lower Bounds on Tree Resolution