It doesn't imply NP is sub-exponential, only that 3SAT is. Conversions to other problems can still end up exponential.
No. NP is always poly time reduceable to 3SAT
alt Hacker News
No. NP is always poly time reduceable to 3SAT