(complexity)A known algorithm (or Turing Machine) that isguaranteed to terminate within a number of steps which is apolynomial function of the size of the problem.
See also computational complexity, exponential time,nondeterministic polynomial-time (NP), NP-complete.