| 1. | It doesn't matter if a collision can be found in exponential time.
|
| 2. | The program that uses Cantor's 1874 construction requires at least sub-exponential time.
|
| 3. | That algorithm took worst-case exponential time but worked independently of the field.
|
| 4. | This takes only exponential time in the size of the input, x.
|
| 5. | For this reason, Pollard's lambda algorithm is considered an exponential time algorithm.
|
| 6. | Na�vely implementing this computation as a recursive algorithm yields an exponential time complexity.
|
| 7. | We can then decide " L " in deterministic exponential time as follows.
|
| 8. | :: Being NP-complete certainly does not imply that the solution takes exponential time.
|
| 9. | For some forms of local consistency, this algorithm may also require exponential time.
|
| 10. | There are however exponential time exact edge coloring algorithms that give an optimal solution.
|
