Is there a probabilistic data structure, such as the bloom filter, for which we could perform intersection superlinearly (at the cost of false positives)? (I only know of a O(n) time complexity set intersection algorithm)


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.