You are here: irt.org | FOLDOC | polynomial-time algorithm
<complexity> A known algorithm (or Turing Machine) that is
guaranteed to terminate within a number of steps which is a
polynomial function of the size of the problem.
See also computational complexity, exponential time,
nondeterministic polynomial-time (NP), NP-complete.
Nearby terms: polymorphism « polynomial « polynomial-time « polynomial-time algorithm » polyvinyl chloride » POM » pompom
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb