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 Cossack eats Poland,
Like stolen fruit;
Her last noble is ruined,
Her last poet mute:
Straight, into double band
The victors divide;
Half for freedom strike and stand;—
The astonished Muse finds thousands at her side.”
—Ralph Waldo Emerson (1803–1882)
“What is clear is that Christianity directed increased attention to childhood. For the first time in history it seemed important to decide what the moral status of children was. In the midst of this sometimes excessive concern, a new sympathy for children was promoted. Sometimes this meant criticizing adults. . . . So far as parents were put on the defensive in this way, the beginning of the Christian era marks a revolution in the child’s status.”
—C. John Sommerville (20th century)