MATH 3260 Algorithms and Complexity

MATH 3260 Algorithms and Complexity
Algorithms and Complexity
Students who have taken neither MATH 2170 nor MATH 3200 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-requistites: MATH 3050 or 3110 or 3200.
credit hours: 3