CISC *7214X Algorithms and Complexity
37½ hours plus conference and independent work; 3 credits
Definitions of P, NP, and NP-complete complexity classes and the relationship between these classes. Approximation algorithms and their efficiency. Other complexity classes. Current models and paradigms of computation. The P? = NP question is discussed and explored. Advanced topics from contemporary research.
Prerequisite: Computer and Information Science 7200X [714X] or a
course in analysis of algorithms.
The City University reserves the right, because of changing conditions,
to make modifications of any nature in academic programs and requirements
of the university and its constituent colleges without advanced notice.
Students are advised to consult regularly with college and department counselors
concerning their programs of study.
Access the college's current and recent course bulletins.