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

Np-Hardness - Is 3 SAT NP-hard or NP-complete?


3-SAT is among Karp's 21 NP-complete problems, and it is commonly used as a basis for proving that other problems are also NP-hard. This is achieved by polynomial-time reduction from 3-SAT to the other problem.