Opposite of a Bloom Filter

Bloom filter gives a \(O(1)\)-efficient way to test for set memberships, but with false positives and no false negatives, i.e. it will tell you \(x\in S\) while actually it is not, but not vice versa. [more]