1.Previous
3.Next

time hypothesis is true, then there would be no algorithm for general CNF satisfiability that is significantly faster than a brute-force search over all possible truth assignments. However, if the strong exponential time hypothesis fails, it would still be possible for to equal one.{{r}}

Other search problems

The exponential time hypothesis implies that many other problems in the complexity class SNP

1.Previous
3.Next