Email this page to a friend

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.

< Previous Terms	Terms Containing polynomial-time algorithm	Next Terms >
polymorphic polymorphic lambda-calculus polymorphism polynomial polynomial-time	deterministic automaton exponential-time exponential-time algorithm knapsack problem non-polynomial	polyvinyl chloride POM Ponder Pong POOL