[erlang-questions] suitability of erlang

Jesper Louis Andersen <>
Mon Oct 15 10:36:41 CEST 2012


On Oct 10, 2012, at 8:30 PM, Joe Armstrong <> wrote:

> Even if you know how long computations take, and you know what
> resources you have
> to solve the computations, then mapping the computations onto the
> resources involves
> solving the knapsack problem which is NP hard.

One would think so. But in practice, the Knapsack problem is pseudo-polynomial and there exists very efficient algorithms for its solution. They are so fast that they often find the knapsack before an O(n lg n) sort has run
on the items.

So this particular problem is solved.

Jesper Louis Andersen
  Erlang Solutions Ltd., Copenhagen






More information about the erlang-questions mailing list