Opportunistic algorithms for eliminating supersets
From MaRDI portal
Publication:758205
DOI10.1007/BF01261654zbMATH Open0724.68045OpenAlexW2070102725MaRDI QIDQ758205FDOQ758205
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Ultimate Planar Convex Hull Algorithm?
- Smoothsort, an alternative for sorting in situ
- Linear prime-number sieves: A family tree
- Another look at the longest ascending subsequence problem
- Algorithms for finding matrix models of propositional calculi
- Forced termination of loops
Cited In (11)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- On the complexity of strongly connected components in directed hypergraphs
- An old sub-quadratic algorithm for finding extremal sets
- On the size of the subset partial order
- Minimal sets on propositional formulae. Problems and reductions
- A simple sub-quadratic algorithm for computing the subset partial order
- Computing the subset partial order for dense families of sets
- Finding extremal sets in less than quadratic time
- Practical algorithms for finding extremal sets
- Fast sequential and parallel algorithms for finding extremal sets
- Fully dynamic algorithms for maintaining extremal sets in a family of sets∗
This page was built for publication: Opportunistic algorithms for eliminating supersets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758205)
