Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
133 views

Is there an efficient algorithm for finding a minimal common subset of pairwise distinct bits in a set of bit strings?

I am working on an efficient mapping function represented as a directed graph. In essence, it is a sort of radix trie. A path must be formed from a bit string [string hereon] efficiently. To do this, ...
AMDG's user avatar
  • 97