An old sub-quadratic algorithm for finding extremal sets

DOI10.1016/S0020-0190(97)00084-7zbMath1336.68143OpenAlexW2037973882MaRDI QIDQ287109

Paul A. Pritchard

Publication date: 26 May 2016

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00084-7

zbMATH Keywords

analysis of algorithmsextremal setsset-theoretic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Extremal set theory (05D05)

Related Items (4)

On the size of the subset partial order ⋮ A simple sub-quadratic algorithm for computing the subset partial order ⋮ Computing the subset partial order for dense families of sets ⋮ Practical Algorithms for Finding Extremal Sets

Cites Work

• Opportunistic algorithms for eliminating supersets
• New trie data structures which support very fast search operations
• Finding extremal sets in less than quadratic time
• Dynamic Perfect Hashing: Upper and Lower Bounds

This page was built for publication: An old sub-quadratic algorithm for finding extremal sets