\ˌɛkspənˈɛnʃə͡ltˈa͡ɪm ˈalɡəɹˌɪθəm], \ˌɛkspənˈɛnʃəltˈaɪm ˈalɡəɹˌɪθəm], \ˌɛ_k_s_p_ə_n_ˈɛ_n_ʃ_əl_t_ˈaɪ_m ˈa_l_ɡ_ə_ɹ_ˌɪ_θ_ə_m]\
Definitions of EXPONENTIAL-TIME ALGORITHM
Sort: Oldest first
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.
By Denis Howe