I want to know any relationship between the complexity class E(and EXP) and NP.
I also would like to know whether there is any $DTIME$ formulation or relations of $NTIME(O(n^k))$ where n is the size of input, and k is constant.
edit: for example, is NP contained in EXP?