mersenneforum.org - View Single Post

bgbeuning · 2021-02-06, 20:55

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.

2021-02-06, 20:55	#2
bgbeuning Dec 2014 3×5×17 Posts	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.