|
Mar 28, 2024
|
|
|
|
CS 6040 - Advanced Algorithms
Advanced topics in the design and analysis of algorithms are explored. These topics include matching and network flow algorithms, randomized algorithms, and parallel algorithms, the theory of NP-completeness, NP-hard optimization problems, polynomial-time approximation algorithms, approximation schemes, approximability and non-approximability results.
Requisites CS 5040 or 5060 Credit Hours: 3.0 Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Eligible grades: A-F,WP,WF,FN,FS,AU,I
Add to Portfolio (opens a new window)
|
|