-
requires superpolynomial time (more specifically,
exponential time). An
algorithm that uses
exponential resources is
clearly superpolynomial, but some...
-
finding a
problem that can be
solved by that
quantum computer and has a
superpolynomial speedup over the best
known or
possible classical algorithm for that...
- ****umption that P ≠ NP,
there exist many
natural problems that
require superpolynomial running time when
complexity is
measured in
terms of the
input size...
- all
known algorithms for NP-complete
problems require time that is
superpolynomial in the
input size. The
vertex cover problem has O ( 1.2738 k + n k...
- much faster. A
function that
grows faster than nc for any c is
called superpolynomial. One that
grows more
slowly than any
exponential function of the form...
- theory, and
probabilistic methods in combinatorics. He
proved the
first superpolynomial improvement on the Erdős–Szekeres
bound on
diagonal Ramsey numbers...
- "Finding
paths between graph colourings: PSPACE-completeness and
superpolynomial distances",
Theoretical Computer Science, 410 (50): 5215–5226, doi:10...
-
algorithms with
compelling potential applications and
strong evidence of
superpolynomial speedup compared to best
known classical (that is, non-quantum) algorithms...
- "linear"
complexity in practice,
although it is in the
worst case
superpolynomial when
performed until convergence. In the worst-case, Lloyd's algorithm...
-
general number field sieve (GNFS).
Because these methods also have
superpolynomial time
growth a
practical limit of n
digits is
reached very quickly....
