You are now in the main content area

MTH 814

Computational Complexity

Order of Growth notation, time and space complexities of DTMs and NDTMs, intractability, basic complexity classes, P=NP?, reducibility and completeness, NP-completeness, Cook's theorem, hierarchy results, circuit complexity, probabilistic algorithms, models for parallel computation.
Weekly Contact: Lecture: 3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1

Prerequisites

MTH 110 or MTH 314

Co-Requisites

None

Antirequisites

None

Custom Requisites

None

Mentioned in the Following Calendar Pages

*List may not include courses that are on a common table shared between programs.