3 ms·
The proof itself would not give factorization algorithm. Even if P = NP, prime factorization can be very time consuming to solve. The prime factorization prob
by nabla9 8y ago
The proof itself would not give factorization algorithm.
Even if P = NP, prime factorization can be very time consuming to solve. The prime factorization problem is in the NP class, but we don't know if it is NP-hard.