[MINI] Exponential Time Algorithms

There is more beneath the surface of xponential Time Algorithms than the title suggests. We discuss the complexity class of EXP-Time which contains algorithms which require $O(2^{p(n)})$ time to run. In other words, the worst case runtime is exponential in some polynomial of the input size.