Hacker News

points by caughtinthought 3 days ago | 0 comments

3SAT can't be solved in sub-exponential time

Fwiw never thought it was a well-named conjecture

*Can be solved

This proves that EXP != NP

This is not a proof that NP != EXP. NP is poly time reduceable to 3SAT + 3SAT is sub-exponential does not imply that NP is sub-exponential -- the cost of the reduction may be enough to push the conjunction from sub-exponential to exponential.

Note https://news.ycombinator.com/item?id=50253213 which explains it better.

[–] caughtinthought 3 days ago

I'm stating the conjecture as requested

[–] pcstl 3 days ago

I think you misunderstood, I believe they were requesting a layperson-friendly explanation of the conjecture and not a statement of it.

[–] moishe_syzslak 3 days ago

Whenever someone asks for an ELI5, there's always got to be somebody who further confuses the issue.

[–] jibalt 3 days ago

How is "This proves that EXP != NP", which is false, a layperson-friendly explanation of the actual proof that 3SAT is sub-exponential?

Note https://news.ycombinator.com/item?id=50253213

[–] caughtinthought 3 days ago

Which is a separate issue than the one you commented originally