Added to Favorites

Computing Dictionary

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.

(1995-04-27)

Explore Dictionary.com

Previous Definition: exponential-time

Next Definition: exponentiation

Words Near: exponential-time algorithm

More from Thesaurus.com

Synonyms and Antonyms for exponential-time algorithm

More from Reference.com

Search for articles containing exponential-time algorithm

More from Dictionary.com Translator

Translate exponential-time algorithm into French

Translate exponential-time algorithm into German

Translate exponential-time algorithm into Italian

Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Nearby Words

Copyright © 2014 Dictionary.com, LLC. All rights reserved.