There is a newer version of the record available.

Published July 16, 2018 | Version v1
Preprint Open

P vs NP

Authors/Creators

  • 1. Joysonic

Description

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? We obtain a contradiction taking as assumption that P = NP. Therefore, we prove P is not equal to NP by reduction ad absurdum.

Files

manuscript.pdf

Files (222.1 kB)

Name Size Download all
md5:d2e0e4a2ce60a420dafc348122c0645b
222.1 kB Preview Download