Assertion: algorithm | /r/CapableOf | run for 2n steps
Facets:
value: on an input of size
type: OTHER
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).