Back to Search
Start Over
P Equals NP
- Publication Year :
- 2022
- Publisher :
- Zenodo, 2022.
-
Abstract
- This paper is on a brief interpretation of class P and NP in infinite Hamming cube consisting all the instances of any language in P or NP as well as all the instances of a Turing machine’s tape per configuration. It is shown that P and NP are more comparablewhen defined in Hamming space; while, this results P = NP.
- Subjects :
- computational complexity
p vs np
p versus np
complexity
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi...........5aedde1d77cf99016acb4f8c371cb4a6
- Full Text :
- https://doi.org/10.5281/zenodo.7621321