4 ms·
Pretty sure that it would require that P=NP if such an event happened. So if factorization was cracked, everything else would be too.
by ertgbnm 2y ago
Pretty sure that it would require that P=NP if such an event happened. So if factorization was cracked, everything else would be too.
- amelius 2y agoAre you sure about that? And even if problems can be solved in polynomial time, the constants involved can be prohibitively large.
- cvoss 2y agoInteger factorization is an NP problem but is not known to be NP-complete. Therefore, we do not know how to solve all NP problems in P time using a hypothetical P time factorization. P =? NP would remain open.