Subset Sum Made Simple — mentioned by chaoxu

Wed, 17 Oct 2018 06:19:41 GMT

Karger's randomized contraction algorithm for finding a min-cut. It's a common algorithm to introduce students into the world of randomized algorithms. Also a shameless plug. My friend and I came up with this pseudo-polynomial time algorithm for subset sum that can be taught in a single session. It is faster than the standard dynamic programming algorithm. https://arxiv.org/abs/1807.08248

Paper and discussion history. A mention is not an endorsement.

Subset Sum Made Simple — HN submission

Tue, 24 Jul 2018 01:57:31 GMT

Subset Sum Made Simple

7 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Subset Sum Made Simple · HackerPapers discussions

Subset Sum Made Simple — mentioned by chaoxu

Subset Sum Made Simple — HN submission