A probabilistic lower bound for checking disjointness of sets

DOI10.1016/0020-0190(84)90129-7MaRDI QIDQ794167zbMATH OpenOpenAlexFDO

Authors 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

decision treeslower boundsprobabilistic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Fast Monte-Carlo Test for Primality
• scientific article; zbMATH DE number 3573787 (Why is no real title available?)
• On the Optimality of Some Set Algorithms
• Probabilistic Algorithms in Finite Fields

Cited in

(1)

• A probabilistic distributed algorithm for set intersection and its analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794167)