P=NP via Factorization and Shor's Algorithm
יהוה, Kaoru Aguilera Katayama
Published Feb 11, 2026• 0 citations
Abstract
We prove $P = NP$ by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in $O(\log\ n)$.
יהוה, Kaoru Aguilera Katayama
We prove $P = NP$ by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in $O(\log\ n)$.