complexity classes

What is the relationship between O(n^log(n)) and O(2^n)? Is the set of complexity classes fully- or partially-ordered?

Some NP-Hard problems can be solved in O(2^n) time. Can we make this statement stronger¹?

---

^{1 - using current technology}