# Time complexity of FPT reduction [closed]

I'm at a loss about how to approach this issue:

Suppose that we know that parameterized problem $$B$$ can be solved in time $$\mathcal O^*(3^k)$$. Furthermore, there is a parameterized reduction from problem $$A$$ to problem $$B$$ that runs in polynomial time. What running time bound can we give for problem $$A$$ if we know that the reduction creates new instances with parameter

(a) at most $$4k$$,
(b) at most $$2k^2$$?

• what is the issue? May 7 at 12:17
• Which notation or statement do you not understand? Your question might be closed if no more details is given. May 7 at 16:12
• Please credit the original source of all copied material: cs.stackexchange.com/help/referencing
– D.W.
May 8 at 4:08
• It's not clear what your question is. Note that we're not looking for posts that are just the statement of an exercise-style task. We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question.
– D.W.
May 8 at 4:08