Hacker News new | past | comments | ask | show | jobs | submit
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

loading story #50254023
loading story #50252575