preprint
Open access
Understanding of P vs NP Problem: With Extension of the Continuum Hypothesis
Research footprint
At a glance
- Citations
- 0
- References
- 7
- Comments
- 0
Paper overview
Öz
P vs NP problem turns out to be P=NP in quantum computing but remains questions of optimization in classical computing.
Record transparency
Publication details
- DOI
- 10.36227/techrxiv.20449572.v4
- OpenAlex
- W4327947954
- Document type
- preprint
- Language
- EN
- Last metadata update
Comments
Oturum Açın to join the discussion.