A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
P Versus Np

2018
*
Zenodo
*

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? A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. To attack the P = NP question the concept of NP-completeness is very useful. If any single NP-complete problem is in P, then P = NP.

doi:10.5281/zenodo.1438784
fatcat:ebvprjh3dneyplykr3aen6bgfy