Sparse Complete Sets for coNP: Solution of the P Versus NP Problem

EasyChair Preprint no. 6893, version history

Version	Date	Pages	Version notes
1	October 19, 2021	11	—
2	October 21, 2021	8	We removed the claim of P=NP and as a consequence, we removed some theorems. We also changed the title and abstract.

Keyphrases: Complement Language, completeness, complexity classes, polynomial time, sparse

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@Booklet{EasyChair:6893,
  author = {Frank Vega},
  title = {Sparse Complete Sets for coNP: Solution of the P Versus NP Problem},
  howpublished = {EasyChair Preprint no. 6893},

  year = {EasyChair, 2021}}