A second course on the design and analysis of algorithms. Topics include: advanced recurrence relations, algebraic complexity, advanced graph algorithms, amortized analysis, algorithms for NP-complete problems, randomized algorithms. Prerequisite(s): COMP 3804 or MATH 3804. Lectures three hours a week. [0.5 credits]
A second course on the design and analysis of algorithms. Topics include: advanced recurrence relations, algebraic complexity, advanced graph algorithms, amortized analysis, algorithms for NP-complete problems, randomized algorithms. Prerequisite(s): COMP 3804 or MATH 3804. Lectures three hours a week. [0.5 credits]
