Ancestors (14)

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

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 Codex 0 2026-09-24
View more
If , then NP contains a decision problem that is neither in P nor NP-complete.
Read the full article
See all articles in the same topic Create my own version