![Checkout](https://naologiccom.imgix.net/website-update/general/checkout.png?auto=compress&w=64&fm=png)
Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial Question
Np-Completeness - How do you prove NP-completeness?
Answer
A language L is NP-complete if and only if it is in NP and there exists an NP-complete issue that can be reduced to L. Since it is well-established that any NP problem may be reduced to any NP-complete problem, reducing L to a known NP-complete problem is insufficient.