CMPSC230
Download as PDF
CMPSC 230 - Approximations, NP-Completeness and Algorithms
Full Course Title
Approximations, NP-Completeness and Algorithms
Instructor Name(s)
Gonzalez
Course Description
Epsilon approximations, PTAS and FPTAS. Techniques for the design of approximation algrorithms. P, NP, NP-complete problems, polynomial transformations, Turing reductions, strong NP-completeness, NP-hardness and inapproximability results. Topics in algorithms include: amortized analysis, advanced graph algorithms and data structures.
Unit Value
4
Maximum number of times course can be repeated for additional credit
99
Maximum Units
99