Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Subset Sum Problem

by TomDLux (Vicar)
on Jun 14, 2003 at 04:35 UTC ( [id://265857]=note: print w/replies, xml ) Need Help??


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

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://265857]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others admiring the Monastery: (2)
As of 2024-04-26 05:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found