Hi,
I need to compute the Cartesian product of an arbitrary number of sets and test the members of the Cartesian product to some conditions. But only a few satisfy the conditions. My problem is that I exceed the permitted memory to soon. Is there a way to compute the Cartesian product member by member and test before saving? If the number of sets is known, it isn't difficult, because you can avoid recursion. But what about an arbitrary number of sets? Thanks for helping, Inneke _______________________________________________ Forum mailing list [email protected] http://mail.gap-system.org/mailman/listinfo/forum
