NP-complete impossible to solve in $O(n)$

167 Views Asked by At

NP-complete problems are likely to be unsolvable in polynomial time (although no one proved it yet). My question is, has anybody proved that they are unsolvable in $O(n^d)$ for some concrete small $d$? Say, has anybody proved that it's impossible to solve subset sum in $O(n)$?