exponential-time algorithm
Learn about this topic in these articles:
computational problems
- In NP-complete problem
…hand, require times that are exponential functions of the problem size n. Polynomial-time algorithms are considered to be efficient, while exponential-time algorithms are considered inefficient, because the execution times of the latter grow much more rapidly as the problem size increases.
Read More