<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, non-deterministic polynomial-time (NP), NP-complete.
(01 Mar 1995)
polyneuropathy, polynomial, polynomial, polynomial-time < Prev | Next >
polynoxylin, polynuclear, polynucleolar
© mondofacto 2008-10 | about us | advertise with us | disclaimer | privacy & cookies | contact us