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.
MTH 814 Requisite Information:
MTH 814 Let's You Take:
  • This course is not a prerequisite for any other courses.
Other:
Prerequisite: MTH 110 or MTH 314
Tell us about MTH 814.
MTH 814 Reviews (0)
Bird
Total Statistics
-

-

Recommend
Total Statistics
-

-

Useful
Total Statistics
-

-