Download PDFOpen PDF in browser

Short Note on P vs NP

EasyChair Preprint no. 7447

3 pagesDate: February 11, 2022


Under 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

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Frank Vega},
  title = {Short Note on P vs NP},
  howpublished = {EasyChair Preprint no. 7447},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser