AMS 542, Analysis of Algorithms
Techniques for designing efficient algorithms, including choice of data structures, recursion, branch and bound, divide and conquer, and dynamic programming. Complexity analysis of searching, sorting, matrix multiplication, and graph algorithms. Standard NP-complete problems and polynomial transformation techniques. This course is offered as both AMS 542 and CSE 548.
3 credits, ABCF grading

THIS COURSE IS STAFFED AND SCHEDULED BY THE COMPUTER SCIENCE DEPARTMENT.

Text:Algorithm Design, by Kleinberg and Tardos, Addison-Wesley.


Spring 2009 Section
Ker-I Ko, MW 2:20-3:40pm, Earth and Space 131, AMS542 Webpage

Spring 2010 Section
53499 LEC 01 MWF 10:40-11:35AM Loc: TBA Inst: Ker-I Ko AMS542 Webpage