Time Complexity - Double Exponential Time

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:

    “Freedom in art, freedom in society, this is the double goal towards which all consistent and logical minds must strive.”
    —Victor Hugo (1802–1885)

    “all the clocks in the city
    Began to whirr and chime:
    “O let not Time deceive you,
    You cannot conquer Time.”
    —W.H. (Wystan Hugh)