|
|||
CIS 522 - Algorithms & ComplexityCredits 3Requirements: Prerequisite: CIS 360 or permission of InstructorLecture / 3 hours per week Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems. Graded |
|||
All catalogs © 2024 UMass Dartmouth. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|