Download PDFOpen PDF in browserShort Note on P vs NPEasyChair Preprint 74473 pages•Date: February 11, 2022AbstractUnder the assumption of certain hypothesis, we show that $P \neq NP$. In this way, we provide another possible tool to prove the $P$ versus $NP$ problem. Keyphrases: completeness, complexity classes, graph, polynomial time
|