Re:Mystery Math Whiz and Novelist Advance Permutation Problem
by nabla9 on Tuesday November 06, 2018 @08:22AM
(#18390706)
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.
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.