News:

Once you registration is approved you will see all the Boards on the Forum.  Non members of the forum only see the Public topics.

Main Menu

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.

Go Down Pages1
Go Up Pages1

Poll
Moved Topic

Locked Topic
Sticky Topic
Topic you are watching