Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.
Trending News
Bin Packing, NP-Hard or Complete?
I've found it in several places defined as NP-Hard and in several places as NP-Complete
i wish to know the true classification of bin packing (one dimensional if it makes a difference)
2 Answers
- Anonymous9 years agoFavorite Answer
This site should help: http://www.econ.upf.edu/~lugosi/binpacking.pdf
- Anonymous4 years ago
Hrmmm... i became into going to point out the halting problem till I observed the "no longer undecidable" qualifier @_@. i think of it could be frustrating adequate to describe _any_ decidable non-NP problem... of direction, i've got on no account taken a direction in computability concept - there could be a "in many circumstances occurring" occasion... i'm going to action picture star it in case somebody who knows the situation sees it. ----- i do no longer think of P = NP solutions this... If there's a dependency someplace, it is truly non-trivial.