Course Code – CP5602
Amortized complexity and online algorithms Ant Colony Optimization (ACO) Bounded-error Probabilistic olynomial-time (BPP) Algorithms Complexity of matrix multiplication. Discussion of the polynomial-time primality algorithms, and some historical survey of prior results. Extensions to the Dijkstra algorithm History of the origins and the theory of finite state machines. Factorization + its application in Cryptography Discrete Logarithm + its application in Cryptography P, NP, and NP Complete Chinese Remaindering + its application in Cryptrography Greed Algorithm versus Dynamic Programming.
Leave a Reply