Does a polynomial solution to weakly-NP Complete problem mean P = NP? Suppose someone finds a polynomial solution to weakly-NP Complete problem does that mean P = NP.
All weakly NP-complete problems are NP-complete by definition,
so yes, a polynomial time algorithm would imply P = NP.