On Mon, Jun 7, 2021 at 1:36 PM Ethan Furman <et...@stoneleaf.us> wrote:
> 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. :) > > > It means each bit flag has only one bit set. In the 'exact cover' definition, that's not a requirement (if it were, it would make the problem too trivial to solve). I also want to mention that 'exact cover' seems a very direct, easy to remember name also for users who are not familiar with the Math definition.. -andrei
_______________________________________________ Python-Dev mailing list -- python-dev@python.org To unsubscribe send an email to python-dev-le...@python.org https://mail.python.org/mailman3/lists/python-dev.python.org/ Message archived at https://mail.python.org/archives/list/python-dev@python.org/message/MZTPKDWUE47ZXJKN6BISFCJ5RZ5XSOS5/ Code of Conduct: http://python.org/psf/codeofconduct/
