Anonymous user
Talk:Subset sum problem: Difference between revisions
→how many solutions?: a lot
(added another section on query of how many solutions. --- ~~~~) |
(→how many solutions?: a lot) |
||
Line 12:
<br>Does anyone have a fast program that could the find exact number of results (whose weights add up to zero)?
<br>Since REXX is an interpretive language, it's not exactly a speed demon for these types of number crunching. -- [[User:Gerard Schildberger|Gerard Schildberger]] 18:03, 3 May 2012 (UTC)
: Apparently there are 349167 combinations of zero sum. Considering subset sum problem is about deciding whether any combination exists at all, that does seem a little high as far as designing a task is concerned: making solutions a dime a dozen doesn't motivate people to use proper methods a difficult task deserves. --[[User:Ledrug|Ledrug]] 20:11, 3 May 2012 (UTC)
| |||