 Weakly NP-complete problems

Weakly NP-complete problems are a subset of decision problems that are considered to be NP-complete, but with a specific characteristic: they can be solved in polynomial time given a solution in the form of a polynomial-size numerical representation. This means that the problem can be solved in polynomial time when the numerical parameters or inputs are bounded by a polynomial size.