Assertion: algorithm | /r/CapableOf | form the complexity class
Facets:
Source sentences:
text: n. More formally, an algorithm is exponential time if T(n) is bounded by O(2nk) for some constant k. Problems which admit exponential time algorithms on a deterministic Turing machine form the complexity class known as EXP.