 |
|
|||||||||||||||||||||||||||||||||||||||||||
| Algorithms and Computational Complexity - COMP9103 | ||||||||||||||||||||||||||||||||||||||||||||
Description Introduction to the basic notions of computational complexity theory: polynomial time computability (P), non deterministic polynominal time computability (NP), polynomial time reductions and NP complete problems. We will show that various real-life problems are NP complete, which explains why no efficient algorithms for such problems have been found. We will also show how one can cope with such problems in an efficient way. We also study other computational complexity classess (polynomial time hierarchy, Polynomial Space and Logarithmic space, etc.)
|
||||||||||||||||||||||||||||||||||||||||||||
