Double Exponential Time
An algorithm is said to be double exponential time if T(n) is upper bounded by 22poly(n), where poly(n) is some polynomial in n. Such algorithms belong to the complexity class 2-EXPTIME.
Well-known double exponential time algorithms include:
- Decision procedures for Presburger arithmetic
- Computing a Gröbner basis (in the worst case)
- Quantifier elimination on real closed fields takes at least doubly exponential time (but is not even known to be computable in ELEMENTARY)
Read more about this topic: Time Complexity
Famous quotes containing the words double and/or time:
“The obsession with suicide is characteristic of the man who can neither live nor die, and whose attention never swerves from this double impossibility.”
—E.M. Cioran (b. 1911)
“Take Time by the forelock. It is also the safest part to take a serpent by.”
—Henry David Thoreau (1817–1862)