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:
“On the death of a friend, we should consider that the fates through confidence have devolved on us the task of a double living, that we have henceforth to fulfill the promise of our friend’s life also, in our own, to the world.”
—Henry David Thoreau (1817–1862)
“I am to be broken. I am to be derided all my life. I am to be cast up and down among these men and women, with their twitching faces, with their lying tongues, like a cork on a rough sea. Like a ribbon of weed I am flung far every time the door opens.”
—Virginia Woolf (1882–1941)