A probabilistic lower bound for checking disjointness of sets
- 26 July 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 19 (1) , 51-53
- https://doi.org/10.1016/0020-0190(84)90129-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972