0
$\begingroup$

I'm working on a project over Bin packing being NP complete, I understand the full reasoning behind it (algorithmically), but I need to know what's a proper explanation for the Bin packing being NP complete (the computational way "theory of computation") not algortihmically.

$\endgroup$
3
  • 1
    $\begingroup$ You should be able to see the similarity to: en.wikipedia.org/wiki/Subset_sum_problem. $\endgroup$
    – TickaJules
    Dec 9 '21 at 20:52
  • $\begingroup$ There's nothing regarding Bin Packing in there $\endgroup$
    – justin
    Dec 9 '21 at 20:54
  • 1
    $\begingroup$ Justin, it’s in there quite obviously. Given items with total size of 20,000, can you split them into two groups with total size 10,000 each? Given items with total size 20,000 and bins of size 10,000, can you fit them into two bins or do you need three bins? $\endgroup$
    – gnasher729
    Dec 10 '21 at 11:37

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.