Anonymous user
Talk:Subset sum problem: Difference between revisions
→how many solutions?: added comment about the worth of optimization (or not). -- ~~~~
(→how many solutions?: a lot) |
(→how many solutions?: added comment about the worth of optimization (or not). -- ~~~~) |
||
Line 14:
: 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)
:: Uf-ta. I was going to put in some optimizations into the REXX program, but with over 1/3 million subsets (for solutions), I'm not going to bother. -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:08, 3 May 2012 (UTC)
| |||