Special Case of The Subset-sum Problem
The partition problem can be viewed as a special case of the subset sum problem and the pseudo-polynomial time dynamic programming solution given above generalizes to a solution for the subset sum problem.
Read more about this topic: Partition Problem
Famous quotes containing the words special, case and/or problem:
“In this century the writer has carried on a conversation with madness. We might almost say of the twentieth-century writer that he aspires to madness. Some have made it, of course, and they hold special places in our regard. To a writer, madness is a final distillation of self, a final editing down. It’s the drowning out of false voices.”
—Don Delillo (b. 1926)
“It was a maxim with Mr. Brass that the habit of paying compliments kept a man’s tongue oiled without any expense; and that, as that useful member ought never to grow rusty or creak in turning on its hinges in the case of a practitioner of the law, in whom it should be always glib and easy, he lost few opportunities of improving himself by the utterance of handsome speeches and eulogistic expressions”
—Charles Dickens (1812–1870)
“A curious thing about the ontological problem is its simplicity. It can be put in three Anglo-Saxon monosyllables: ‘What is there?’ It can be answered, moveover, in a word—‘Everything.’”
—Willard Van Orman Quine (b. 1908)