June 7, 2021
5:24 p.m.
On 6/6/21 9:14 AM, Irit Katriel via Python-Dev wrote:
On 6 Jun 2021, at 16:58, Andrei Kulakov wrote:
In Math / CompSci there is a definition that almost exactly matches this: Exact Cover - https://en.wikipedia.org/wiki/Exact_cover
The difference is that, IIRC, solving the problem is finding and removing all subsets that are unneeded to create an exact cover, so it's kind of arriving at it from a different direction, but 'exact cover' definition itself is a good match.
I’m not sure it’s a quite the same - it doesn’t require that the sets in the cover have cardinality 1, which I think Ethan does.
Well, I'm not sure what "cardinality 1" means, so I don't know if I do or not. :) -- ~Ethan~