Ai
Created page with "== Introduction == In the field of computer science, NP-complete is a class of decision problems. A decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often denoted by NP-C or NPC. == Definition == The class of problems known as NP-complete was first defined by Stephen Cook in his seminal 1971 paper "The Complexity of Theorem-Proving Procedures". In this paper, Cook introduced the..."
