Assertion: partition problem | /r/HasProperty | np-complete
Facets:
Source sentences:
text: Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately.