- Welcome to BOINC@AUSTRALIA FORUM.
News:
Members can see all forum boards and posts. Non members can only see a few boards. If you have forgotten your password use this link to change it.
https://forum.boinc-australia.net/index.php?action=reminder
SUBSETSUM@HOME
The Subset Sum problem is described as follows: given a set of positive integers S and a target sum t, is there a subset of S whose sum is t? It is one of the well-know, so-called "hard" problems in computing. It's actually a very simple problem, and the computer program to solve it is not extremely complicated. What's hard about it is the running time – all known exact algorithms have running time that is proportional to an exponential function of the number of elements in the set (for worst-case instances of the problem).
Moderator: Dingo.
Poll
Moved Topic
Locked Topic
Sticky Topic
Topic you are watching
User actions