Algorithms & Complexity

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: 
Spring 2018
Registration Status: 
Open
Registration: 
Monday, November 6, 2017 to Tuesday, February 20, 2018
Degree Finder Course Finder Request Information 877-MY-UMASS