News for hackers. Stuff that matters.
Re:Breakthrough a step toward revealing hidden structure of ... by cvoss on Thursday August 01, 2024 @09:31AM (#41128891)
Integer 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.

There are no comments on this comment yet.