Assertion: algorithm | /r/HasProperty | upper bounded
Facets:
value: by 22poly(n
type: OTHER
Source sentences:
text: 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