Short Note on P vs NP

EasyChair Preprint no. 7447

Abstract

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

@Booklet{EasyChair:7447,
  author = {Frank Vega},
  title = {Short Note on P vs NP},
  howpublished = {EasyChair Preprint no. 7447},

  year = {EasyChair, 2022}}