Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Np-Completeness - What problems are not NP-complete?


Several NP problems that are neither in P or known to be NP-complete are believed to be NP-intermediate, such as the integer factorization problem, the discrete logarithm problem, and the graph isomorphism issue.