Euler diagram for P , NP , NP-complete, and NP-hard set of problems. The left side is valid under the assumption that P≠NP , while the right side is valid under the assumption that P=NP (except that the empty language and its complement are never NP-complete) (July 2012) In computational complexity theory , a decision problem is NP-complete when it is both in NP and NP-hard . The set of NP-complete problems is often denoted by NP-C or NPC. The abbreviation NP refers to " nondeterministic polynomial time ".
Read full article from NP-complete - Wikipedia, the free encyclopedia
No comments:
Post a Comment