intractable problem

computer science

Learn about this topic in these articles:

In NP-complete problem
Algorithms for solving hard, or intractable, problems, on the other 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…
Read More
In P versus NP problem
…allowed the solution of formerly intractable problems.
Read More