in reply to Subset Sum Problem

CS people are notoriously mediocre mathemeticians. Why don't you find a math list to ask math questions

--
TTTATCGGTCGTTATATAGATGTTTGCA

Replies are listed 'Best First'.
Re: Re: Subset Sum Problem
by tall_man (Parson) on Jun 16, 2003 at 15:53 UTC
    On the other hand, sometimes mathematicians are mediocre programmers. Look at this "solution" to the subset sum problem: Subset Sum. He says to multiply out N binomials and collect the terms, which is O(2^N). Mathematically it's correct; computationally it's not feasible.

    (I know that the subset sum problem is NP-complete, it's just the author of the article presents this as a solution without mentioning the issue at all.)

[reply]

In Section Seekers of Perl Wisdom