Relationship between SPACE(n) and E Is it known whether SPACE(n) (the class of languages recognized by deterministic TMs with linear space) is a proper subset of E (the class of languages recognized by deterministic TMs in time 2^O(n))?
If in fact DSPACE(n) = E, then a padding argument would translate this to PSPACE=EXP.
Similarly, if DSPACE(n) $\neq$ E then a padding argument would translate this to L $\neq$ P.