Computational Complexity: Course Lectures and Chapter Summaries

William Shoaff

The chapter summaries are from [Papadimitriou(1994)]

Lecture Topic	Chapter Overview
Course Overview	Chapter 1
History of Theoretical Computer Science
Preliminaries: Languages, Relations, Graphs, etc.
Computational Models
Turing Machines
Problems
Reducibility
Complexity Classes
Completeness
NP Problems
co-NP Problems
Randomized Computation
To be continued

Bibliography

natexlab url

Papadimitriou(1994)

Christos H. Papadimitriou.
Computational Complexity.
Addison-Wesley, 1994.
ISBN 0-201-53082-1.