please can you provide either a reference, or give particular examples of PSPACE-complete problems which are solvable in pseudo-polynomial time?
Definition of pseudo-polynomial time: http://en.wikipedia.org/wiki/Pseudo-polynomial_time
In reply to some comments mentioned earlier. I have asked earlier if there were any problems which were PSPACE-complete which had an FPTAS. The surprizing answer was YES!
This is therefore a follow-up question.
(Note that the EXP conjecture apply to the complexity class NP, yet there exists NP-complete problems which are solvable in psuedo-polynomial time!)
Addendum... Sasho Nikolov asked about FPT and Pspace. I know that there are FPT problems which are Pspace , Exp, Exp Space complete etc... Unfortunately I do not have references... Will correct when I remember