| 11. | Equivalently, any improvement on these running times would falsify the strong exponential time hypothesis.
|
| 12. | All the best-known algorithms for NP-complete problems like 3SAT etc . take exponential time.
|
| 13. | Currently, there is no known sub-exponential time algorithm that can solve this problem deterministically.
|
| 14. | Showed that finding-vertex cliques cannot be done in time unless the exponential time hypothesis fails.
|
| 15. | Even when they terminate, parsers that use recursive descent with backtracking may require exponential time.
|
| 16. | "Evolution doesn't reward proteins that take an exponential time to fold up, " he said.
|
| 17. | The exponential time hypothesis implies P ` " NP.
|
| 18. | At the cost of a potentially exponential time increase, loops can be detected space-efficiently as follows:
|
| 19. | However, if the strong exponential time hypothesis fails, it would still be possible for " s"
|
| 20. | For example, an exponential time algorithm can sometimes still be fast enough to make a feasible attack.
|
