Hacker News
points by luc4 3 days ago | 0 comments
I mean the result that k-SAT cannot be solved in 2^{o(n)} clearly would imply P!=NP, but how does ETH imply NP = EXP? And how does \neg ETH imply NP != EXP?
Aún no hay comentarios.
Hacker News