Basic sanity check on NP-complete solutions:
Suppose there was a polynomial time solution for an NP-complete problem, but the size of NP-complete problems that could be solved is still relatively small (i.e. N = 32-64) due to limits in technology.
Would this show that P = NP? Or would this be more like the pseudo-solution that the unary subset sum is in P?