P=NP via Factorization and Shor's Algorithm
Abstract
We prove $P = NP$ by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in $O(\log\ n)$.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Quantum Computing Algorithms and Architecture
Cryptography and Data Security
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 11 February 2026
- Language
- EN
- Document type
- Preprint