View Single Post
Old 2021-02-06, 20:55   #2
bgbeuning
 
Dec 2014

111111112 Posts
Default

Learning about NP-complete problems was a while a go,
but "which factorization is closest to sqrt(N)" sounds like
the "0-1 knapsack" problem.
bgbeuning is offline   Reply With Quote