Here the same old logic of reducing the well known NP-Complete problem into the Clique problem is used to prove that the Clique problem is as hard as the 3-SAT problem. This proves that the Clique problem is indeed an NP-Complete.
Негізгі бет Ойын-сауық Clique problem is NP-Complete
Пікірлер