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:
“Art has a double face, of expression and illusion, just like science has a double face: the reality of error and the phantom of truth.”
—René Daumal (1908–1944)
“I have tried too in my time to be a philosopher; but, I don’t know how, cheerfulness was always breaking in.”
—Oliver Edwards (1711–1791)