Home >  Term: polynomial time
polynomial time

When the execution time of a computation, m(n), is no more than a polynomial function of the problem size, n. More formally m(n) = O(nk) where k is a constant.

0 0

Penulis

  • GeorgeV
  •  (Gold) 1123 poin
  • 100% positive feedback
© 2024 CSOFT International, Ltd.