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:
“Under the lindens on the heather,
There was our double resting-place.”
—Walther Von Der Vogelweide (1170?–1230?)
“Whenever the weather licks the pilot instead of him lickin’ the weather, he’s finished. The first time makes the second time easier. And the first thing he knows, he’s in trouble when the weather is perfect.”
—Frank W. Wead (1895?–1947)