0%

exponential-time algorithm

E e

Transcription

    • US Pronunciation
    • US IPA
    • US Pronunciation
    • US IPA

Definition of exponential-time algorithm words

  • noun Technical meaning of exponential-time algorithm (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. Even if such an algorithm is practical for some given value of n, it is likely to become impractical for larger values. This is in contrast to a polynomial-time algorithm which grows more slowly. See also computational complexity, polynomial-time, NP-complete. 1

Information block about the term

Parts of speech for Exponential-time algorithm

noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation

See also

Matching words

Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?