Anonymous user
Talk:Subset sum problem: Difference between revisions
no edit summary
(started the discussion) |
No edit summary |
||
Line 2:
[[User:Sluggo|Sluggo]] 15:58, 1 January 2012 (UTC)
: 1) Why the words? 2) Caution about trying all subsets being "infeasible" seems superfulous. The problem is NP-complete, so for any algorithm, it's easy enough to construct a data set that will run (practically) forever or exhaust memory. --[[User:Ledrug|Ledrug]] 08:16, 2 January 2012 (UTC)
| |||