-
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...
- 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...
-
algorithm is
impractical for most
applications because of its
potentially superpolynomial running time. One
consequence of this is that USTCON, and so SL, is...
- 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...
- {\displaystyle c>0} . All
known groups with
intermediate growth (i.e. both
superpolynomial and subexponential) are
essentially generalizations of Grigorchuk's...
-
supergroup has a
similar one to one
relation to its Hopf
algebra of
superpolynomials.
Using the
language of schemes,
which combines the
geometric and algebraic...
- "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 (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...
