News for hackers. Stuff that matters.
Re:The image in this post displays its own MD5 hash by nullc on Saturday September 24, 2022 @01:11AM (#32959883)
> you need a solution that only applies each available perturbation zero or one times

I'd usually go to wagner's k-tree algorithm for a modular subset sum problem.

But these are pretty small instances and you shouldn't need to use a particularly memory efficient algorithm. So for example, splitting the space of all choices in two, enumerating all combinations on each side and searching for a meet-in-the middle should also work.

There are no comments on this comment yet.