MATH 326 Algorithms and Complexity

Students who have taken neither MATH 217 nor MATH 320 require the permission of the instructor. A study of important algorithms (including searching and sorting, graph/network algorithms, and algorithms in number theory) and algorithm design techniques (including greedy, recursive, and probabilistic algorithms). Covers the analysis of algorithms (including worst-case and average-case analysis) and discussions of complexity classes for decision and enumeration problems (including P, NP, #P, PSPACE.

pre-rec: MATH 305 or 311 or 320.