Analysis and Intractability of Algorithms

Catalog description

Study of algorithms; efficient, optimal algorithms and analysis for best, worst, and average performance; computational complexity theory; algorithmic time and space bounds; levels of intractability including polynomial-time reducibility, NP-complete and NP-hard problems, and Co-NP; applications. A core course in the Computer Science M.S. program. Undergraduates must obtain consent of instructor to enroll. Enrollment Requirement(s): for graduate students CS 311 . Prerequisite(s): for undergraduate students CS 311 .