# Is it interesting to make an FPT algorithm for a P-Space completer problems?

I have done a course on paramertized algorithms. For NP-Hard problem, Most of the researchers try to design an Fixed parameter Tractable algorithm. Let $$P$$ be a some P-Space complete problem.

Question : Is it interesting to make an FPT algorithm for a P-Space completer problems