Yes indeed. That's the whole point of NP-completeness. I was thinking of non-constructive proofs. I mean Polynomial time doesn't necessarily mean it will be quick. If someone comes up with, say O(n¹⁰⁰), that wouldn't be practical. But I clearly messed up.

I made the correction. Thanks for the feedback!