Can we consider 3-SAT to be strongly NP-complete? In the knapsack problem, we have a polynomial time algorithm in input size when we consider unary encoding of the input. This makes it weakly NP-complete. We do not have any such algorithm in case of 3-SAT. Does that make it strongly NP-Complete?