A probabilistic lower bound for checking disjointness of sets
type: Item
instance of: scholarly article
title: A probabilistic lower bound for checking disjointness of sets
zbMATH Open document ID: 0539.68036
DOI: 10.1016/0020-0190(84)90129-7
author: Udi Manber
published in: Information Processing Letters
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3858411
zbMATH Keywords: probabilistic algorithms
zbMATH Keywords: lower bounds
zbMATH Keywords: decision trees
MaRDI profile type: Publication
full work available at URL: 0020-0190(84)90129-7
OpenAlex ID: W2065923145
cites work: Q4145647
cites work: Probabilistic Algorithms in Finite Fields
cites work: On the Optimality of Some Set Algorithms
cites work: A Fast Monte-Carlo Test for Primality
description: scientific article; zbMATH DE number 3858411