Don't ask to ask, just ask | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
The only way to deal with this efficiently is to reduce the input sets to non-overlapping sets prior to permuting them. To do that, you need to lay out the rules for overlapping sets. You'd need to define how to deal with:
Whence you've defined how all the possibilities should be resolved into distinct groups, the rest should be relatively easy. I'm still bugged by your lack of explanation of what the purpose of this is? With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
In reply to Re^5: Multiple Combinatorics
by BrowserUk
|
|