Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
exponential-time algorithm
Jump to user comments
complexity An algorithm (or Turing Machine) that is
guaranteed to terminate within a number of steps which is a
exponential function of the size of the problem.
For example, if you have to check every number of n digits to
find a solution, the complexity is O(10^n), and if you add
an extra digit, you must check ten times as many numbers.