Opportunistic algorithms for eliminating supersets

DOI10.1007/BF01261654zbMath0724.68045OpenAlexW2070102725MaRDI QIDQ758205

Paul A. Pritchard

Publication date: 1991

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01261654

zbMATH Keywords

opportunistic algorithmsuperset elimination

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (11)

Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗ ⋮ An old sub-quadratic algorithm for finding extremal sets ⋮ Computing the union join and subset graph of acyclic hypergraphs in subquadratic time ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ On the size of the subset partial order ⋮ Fast sequential and parallel algorithms for finding extremal sets ⋮ A simple sub-quadratic algorithm for computing the subset partial order ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Computing the subset partial order for dense families of sets ⋮ Finding extremal sets in less than quadratic time ⋮ Practical Algorithms for Finding Extremal Sets

Cites Work

• Linear prime-number sieves: A family tree
• Another look at the longest ascending subsequence problem
• Smoothsort, an alternative for sorting in situ
• Algorithms for finding matrix models of propositional calculi
• Forced termination of loops
• The Ultimate Planar Convex Hull Algorithm?
• Unnamed Item
• Unnamed Item

This page was built for publication: Opportunistic algorithms for eliminating supersets