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 worst feature of this double consciousness is, that the two lives, of the understanding and of the soul, which we lead, really show very little relation to each other; never meet and measure each other: one prevails now, all buzz and din; and the other prevails then, all infinitude and paradise; and, with the progress of life, the two discover no greater disposition to reconcile themselves.”
—Ralph Waldo Emerson (1803–1882)
“Although it is generally known, I think it’s about time to announce that I was born at a very early age.”
—Groucho Marx (1895–1977)