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:
“Was it the double of my dream
The woman that by me lay
Dreamed, or did we halve a dream
Under the first cold gleam of day?”
—William Butler Yeats (1865–1939)
“Time kills me terribly.
“Time shall not murder you,” He said,
“Nor the green nought be hurt;
Who could hack out your unsucked heart,
O green and unborn and undead?”
I saw time murder me.”
—Dylan Thomas (1914–1953)