Assertion: algorithm's time | /r/HasProperty | superpolynomial
Facets:
Source sentences:
text: An algorithm is said to take superpolynomial time if T(n) is not bounded above by any polynomial.
text: Without the domination condition, this may not be possible since the algorithm which solves L in polynomial time on average may take super-polynomial time on a small number of inputs but f may map these inputs into a much larger set of D' so that algorithm A' no longer runs in polynomial time on average.
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.
text: Shor's algorithm solves the discrete logarithm problem and the integer factorization problem in polynomial time, whereas the best known classical algorithms take super-polynomial time.
text: It is also one of the few quantum algorithms that solves a non–black-box problem in polynomial time where the best known classical algorithms run in super-polynomial time.