# PSPACE and DTIME $2^{cn}$

This is a HW question that I'm stuck on and was hoping for some help. we're supposed to prove that:

PSPACE not equals DTIME($2^{cn}$) for every $c>0$ (or actually for the union of all $c>0$)

• What did you try? Where did you get stuck? We're happy to help you with the concepts but, with the question posed the way it is, the only way to answer it is to do your homework for you. – David Richerby Apr 13 '16 at 14:48
• I honestly don't even know where to start. I thought of using TQBF and it's PSPACE completeness somehow but have no idea how to do that. – Olga Apr 13 '16 at 14:51

This can be proved by contradiction. You can use the fact that $PSPACE$ language remains $PSPACE$ if we remove polynomial length padding, where as $DTIME$ does not.