# A query regarding Strongly NP Complete problem reduction/definition

Given a known strongly NP Complete problem $$A$$. If there is a polynomial time transformation from $$A$$ to another problem NP Complete problem $$B$$ does that imply anything about if $$B$$ is always/automatically strongly NP complete or not?

I don't think that it is necessary that $$B$$ is always/automatically strongly NP Complete but some other sources seem to suggest the opposite. Thus a bit confused.

• Take any strongly NP Complete problem for A and any NP Complete B for which we know a pseudo-polynomial time algorithm. Is there a poly-time reduction from A to B? (remember that B is NPC). That should answer your question. Oct 11 at 10:38
• @Tassle why don't you post your comment as an answer so we can upvote it and it can be accepted? Oct 11 at 10:39
• @Nathaniel Yep I should have. Done Oct 11 at 10:41