All NP problems can be reduced to NP-Complete problems, can an NP-Complete problem be reduced to a NP problem (non complete)?


1 Answer 1


An NP-complete problem is in NP, by definition. No reduction needed.

  • 1
    $\begingroup$ Okay I feel really dumb now! Thanks for making it clear $\endgroup$ Aug 1, 2020 at 3:57
  • 2
    $\begingroup$ @PedroPapel Welcome to Computer Science! please consider accepting this as the answer if it helped you, thank you. $\endgroup$
    – Evil
    Aug 2, 2020 at 23:38

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.