If , then NP contains a decision problem that is neither in P nor NP-complete.

Ancestors (7)

  1. NP-completeness
  2. NP-hardness
  3. Polynomial-time many-one reduction
  4. Computational complexity theory
  5. Theoretical computer science
  6. Computer science
  7. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Ladner's Theorem by Ciro Santilli 40 Updated 2025-07-16
Read the full article
See all articles in the same topic Create my own version