Opportunistic algorithms for eliminating supersets
From MaRDI portal
(Redirected from Publication:758205)
Recommendations
Cites work
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Algorithms for finding matrix models of propositional calculi
- Another look at the longest ascending subsequence problem
- Forced termination of loops
- Linear prime-number sieves: A family tree
- Smoothsort, an alternative for sorting in situ
- The Ultimate Planar Convex Hull Algorithm?
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)
