by Ciro Santilli (@cirosantilli, 34)
A problem such that all NP problems can be reduced in polynomial time to it.

Ancestors (11)

  1. NP (complexity)
  2. EXPTIME
  3. ELEMENTARY (complexity)
  4. Complexity class
  5. Computational problem
  6. Computer science
  7. Computer
  8. Information technology
  9. Area of technology
  10. Technology
  11. 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 (0)

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