Assertion: algorithm | /r/Desires | superpolynomial time
Facets:
Source sentences:
text: For example, an algorithm that runs for 2n steps on an input of size n requires superpolynomial time (more specifically, exponential time).
text: An algorithm that requires superpolynomial time lies outside the complexity class P. Cobham's thesis posits that these algorithms are impractical, and in many cases they are.