Note for the P Versus NP Problem (II)

EasyChair Preprint 13469, version history

Version	Date	Pages	Version notes
1	May 29, 2024	5
2	May 29, 2024	5	We improved the Theorem 1.
3	May 29, 2024	5	We changed the sentence "The last commit was on March 29th of 2024" by "The last commit was on May 29th of 2024" (i.e. today). Besides, we changed the date in the reference of the access in the Github project (for today as well).
4	May 30, 2024	5	We improved the Theorem 1 and modified Github project in a last commit.
5	June 3, 2024	6	We introduced wieght to the edges from the line graph
6	July 1, 2024	5	We fixed the proof of P = NP changing the studied NP-complete problem as a target.

Keyphrases: Boolean formula, 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:

@booklet{EasyChair:13469,
  author    = {Frank Vega},
  title     = {Note for the P Versus NP Problem (II)},
  howpublished = {EasyChair Preprint 13469},
  year      = {EasyChair, 2024}}