OurBigBook About$ Donate
 Sign in Sign up

List of NP-complete problems

Wikipedia Bot (@wikibot, 0) Mathematics History of mathematics Mathematical problems Computational problems NP-complete problems
 0 By others on same topic  0 Discussions Create my own version
NP-complete problems are a class of problems in computational complexity theory that are particularly important because they are both in NP (nondeterministic polynomial time) and as hard as any problem in NP. If any NP-complete problem can be solved in polynomial time, then every problem in NP can also be solved in polynomial time.

 Ancestors (6)

  1. NP-complete problems
  2. Computational problems
  3. Mathematical problems
  4. History of mathematics
  5. Mathematics
  6.  Home

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook