IAM511 - Algorithms and Complexity
Instructor(s): Murat Cenk
Prerequisites: Consent of Instructor(s)
Course Catalogue DescriptionFormal techniques for design and analysis of algorithms, methods for specifying algorithms,proving an algorithm´s correctness, basics of algorithmic efficiency, asymptotic notations and basic efficiency classes, computational complexity, complexity classes P, NP,NP-completeness/hardness, mathematical analysis of algorithms, divide-and-conquer, space and time trade-offs, and number-theoretical algorithms.
Course ObjectivesThe aim of the course is to present the basic topics in algorithms and complexity needed in cryptography. The fundamental algorithms in cryptography will be introduced and their complexities will be studied .
Course Learning OutcomesStudents are going to be familiar with the design and analysis of algorithms used in cryptography. They will be able to compute the complexities of the algorithms and to design new algorithms with the improved complexities.
More Info on METU CatalogueBack