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:
“To be a woman and a writer
is double mischief, for
the world will slight her
who slights “the servile house,” and who would rather
make odes than beds.”
—Dilys Laing (1906–1960)
“Anyone can be heroic from time to time, but a gentleman is something you have to be all the time.”
—Luigi Pirandello (1867–1936)
Related Phrases
Related Words