Algorithm Analysis

3 credit hours · Graduate

Some of the key techniques of efficient algorithm design that will be discussed: divide and conquer; greedy methods; dynamic programming; graph traversal; and change of representation. Measuring algorithm performance and lower bounds for various problems will be studied. An introduction to complexity theory-P, NP, polynomial time reducibility, and NP-completeness- will also be provided.