Strongly NP-complete problems
ID: strongly-np-complete-problems
Strongly NP-complete problems are a subset of NP-complete problems that remain NP-complete even when the numerical values in the input are bounded by a polynomial in the size of the input. This contrasts with "weakly NP-complete" problems, which can be solved in polynomial time when the numbers involved are small (i.e., their magnitude is polynomially bounded) but may be hard in the general case where numerical values can be arbitrary.
New to topics? Read the docs here!