3 ms·
No, factoring being in P would not imply P == NP. Factoring is not NP-hard.
by Ar-Curunir 4y ago
No, factoring being in P would not imply P == NP. Factoring is not NP-hard.
- Laakeri 4y agoWell, it is also not proved to not be NP-hard, so it could also be NP-hard to our current knowledge. But you are right that researchers believe that it's not NP-hard.
- Ar-Curunir 4y agoGood catch, you’re right, nobody has yet proven that factoring is NP-hard, but a ton of evidence indicates that it is highly unlikely to be NP-hard