by Ciro Santilli (@cirosantilli, 37)
A problem that is both NP and NP-hard.
Interesting because of the Cook-Levin theorem: if only a single NP-complete problem were in P, then all NP-complete problems would also be P!
We all know the answer for this: either false or independent.

Ancestors (12)

  1. NP (complexity)
  2. PSPACE
  3. EXPTIME
  4. ELEMENTARY (complexity)
  5. Complexity class
  6. Computational problem
  7. Computer science
  8. Computer
  9. Information technology
  10. Area of technology
  11. Technology
  12. Home

Incoming links (5)

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version