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:
“You spotted snakes with double tongue,
Thorny hedgehogs, be not seen.
Newts and blindworms, do no wrong,
Come not near our Fairy Queen.”
—William Shakespeare (1564–1616)
“Middle age is the time when a man is always thinking that in a week or two he will feel as good as ever.”
—Don Marquis (1878–1937)
Related Phrases
Related Words