Directory
References
Discover
size
of a computation
Learn about this topic in these articles:
NP-complete problems
- In NP-complete problem
, for a problem of size n, the time or number of steps needed to find the solution is a polynomial function of n. 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…
Read More