0
$\begingroup$

I need a list of at least 10 weakly NP-HARD problems. I already know the Knapsack problem, partition problem and subset sum problem. Please introduce other weakly NP-hard problems to me.

$\endgroup$
2
  • $\begingroup$ There are countably many weakly NP-Hard problems... it'll be hard to make a semi-complete list :) $\endgroup$
    – Steven
    Commented Aug 11, 2023 at 22:56
  • $\begingroup$ Ok. I edit my question to know at least 10 weakly NP-HARD problems. $\endgroup$ Commented Aug 11, 2023 at 23:14

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.