Yoooooooooo ! > FWIW the problem (or a slight variant of it) is known in complexity theory > as learning of monotone boolean functions. To translate your problem to this > language, you have to consider your sets as subsets of a common large set > with n elements and describe the subsets by n-tuples.
Excellent ! That's exactly what my code does. I will try to look for some interesting things about that now that I know the correct terminology. Thanks ! > Of course, you might > find more negative results than implemented algorithms in the complexity > theory literature. I know what I can expect of the graph theory world, but I do not know those guys much so I will have faith at least for a while. Let's see how it goes :-) Thanks again ! Nathann -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
