A probabilistic lower bound for checking disjointness of sets

DOI10.1016/0020-0190(84)90129-7zbMath0539.68036OpenAlexW2065923145MaRDI QIDQ794167

Udi Manber

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90129-7

zbMATH Keywords

probabilistic algorithmslower boundsdecision trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

A probabilistic distributed algorithm for set intersection and its analysis

Cites Work

• Unnamed Item
• Probabilistic Algorithms in Finite Fields
• A Fast Monte-Carlo Test for Primality
• On the Optimality of Some Set Algorithms

This page was built for publication: A probabilistic lower bound for checking disjointness of sets