Published February 11, 2026
| Version אֵין דָּבָר מְכֻסֶּה שֶׁלֹּא יִגָּלֶה, וְסָתוּם שֶׁלֹּא יִוָּדַע
Preprint
Open
P=NP via Factorization and Shor's Algorithm
Authors/Creators
Description
We prove $P = NP$ by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in $O(\log\ n)$.
Files
P=NP_via_Factorization_and_Shor_s_Algorithm.pdf
Files
(137.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:04dec74ae1bd400198fa26c63e84fd8f
|
2.0 kB | Download |
|
md5:cd728b6e687e3a370068a2107ad50892
|
135.1 kB | Preview Download |