Steam-powered Turing Machine University of Washington Computer Science & Engineering
 Syllabus for CSE532: Complexity Theory
  CSE Home   About Us    Search    Contact Info 

CSE532: Complexity Theory

Credits
3
Catalog description
Deterministic, nondeterministic, alternating, and probabilistic Turing machines. Time and space complexity, complexity classes, complexity hierarchies, and provably intractable problems.
Prerequisites
CSE major and CSE 531.
Textbook(s) and/or other required material
none
Course objectives
none
Topics covered
none
Course structure
none
Last edited by
none
Last modified
(never)

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to webmaint]