Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems.
Course Details
Campus:
Dartmouth
Format:
Online
Level:
Graduate
Subject:
Computer & Info Science
Number:
CIS 522
Semester:
Fall 2019
Registration Status:
Closed
Registration:
Monday, April 1, 2019 to Wednesday, September 11, 2019
