3 ms·
Can we compresses further by optimizing for only testing set membership?
by charcircuit 5y ago
Can we compresses further by optimizing for only testing set membership?
- hinkley 5y agoThere is probably a bloom filter that covers all 26*5 possibilities with no false positives but that's somewhere over 10 bits per element or 16215 bytes not counting the encoder. Might be a perfect hash waiting in there somewhere.