It doesn't imply NP is sub-exponential, only that 3SAT is. Conversions to other problems can still end up exponential.
Yeah, I was wrong. Page two too, I commented too soon.
NP is not yet proven to be subexponential but still, ETH disproven is huge
No. NP is always poly time reduceable to 3SAT
alt Hacker News
Yeah, I was wrong. Page two too, I commented too soon.
NP is not yet proven to be subexponential but still, ETH disproven is huge