On the Number of Comparisons to Find the Intersection of Two Relations

DOI10.1137/0208030MaRDI QIDQ3851621zbMATH OpenOpenAlexFDO

Authors

Publication date 1979

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0208030

zbMATH Keywords

comparison treecomputational complexitydecision treeduplication problemintersection of relationslexicographic orderrelational algebrasorting vectors

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(1)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: On the Number of Comparisons to Find the Intersection of Two Relations

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