KnowraNP-completenessLinked fromLinked fromThe 22 pages that link to NP-completeness, each with the reason it gives.All 22Broader topic 3Related 10Narrower topic 7Compared with 2Computational complexity theoryBroader topic: An efficient algorithm for any NP-complete problem would imply P equals NP.Nondeterministic Turing machineBroader topic: NP-complete problems capture the hardest cases associated with polynomial-time nondeterminism.Theoretical computer scienceBroader topic: It is established through reductions and captures a central unresolved boundary.