Revision history [back]

The complexity of an algorithm for an NP problem is typically exponential. This means that the time required to solve the problem grows exponentially with the size of the input. However, there are some algorithms that can solve certain NP problems in polynomial time, but they are not known for most problems in the NP class.