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
@booklet{EasyChair:6893, author = {Frank Vega}, title = {Dense Complete Set For NP}, howpublished = {EasyChair Preprint 6893}, year = {EasyChair, 2021}}