Book which has a proof of NP-completness for Partition Problem

Question

I need the name of a book which has a proof of NP-completness for Partition Problem. I need to cite it in a my bachelor thesis.

score 1 · Accepted Answer · answered Jan 21 '15 at 16:59

1

Garey, Michael; Johnson, David (1979). Computers and Intractability; A Guide to the Theory of NP-Completeness. pp. 96–105

answered Jan 21 '15 at 16:59

Loreno Heer

1 Answers1