exponential-time algorithm

(complexity)An algorithm (or Turing Machine) that isguaranteed to terminate within a number of steps which is aexponential function of the size of the problem.

For example, if you have to check every number of n digits tofind a solution, the complexity is O(10^n), and if you addan extra digit, you must check ten times as many numbers.

Even if such an algorithm is practical for some given value ofn, it is likely to become impractical for larger values. Thisis in contrast to a polynomial-time algorithm which growsmore slowly.

See also computational complexity, polynomial-time,NP-complete.

单词	exponential-time algorithm
释义	exponential-time algorithm exponential-time algorithm (complexity)An algorithm (or Turing Machine) that isguaranteed to terminate within a number of steps which is aexponential function of the size of the problem. For example, if you have to check every number of n digits tofind a solution, the complexity is O(10^n), and if you addan extra digit, you must check ten times as many numbers. Even if such an algorithm is practical for some given value ofn, it is likely to become impractical for larger values. Thisis in contrast to a polynomial-time algorithm which growsmore slowly. See also computational complexity, polynomial-time,NP-complete.
随便看	de-escalations de-escalatory deescom deese-roediger-mcdermott deesge deesgest deeside college centre for aerospace training deeside rugby football club deeside transport system deeside urban wildlife group deesimmo deesis deesma deesmi dees, morris, jr. deesmt de-espar deess deesth deesweb deet deethanize deethanizer deetjen deetjen bodies