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:
“Because I have work to care about, it is possible that I may be less difficult to get along with than other women when the double chins start to form.”
—Gloria Steinem (b. 1934)
“No man can love a second time the person whom he has once truly ceased to love.”
—François, Duc De La Rochefoucauld (1613–1680)