An old sub-quadratic algorithm for finding extremal sets
From MaRDI portal
Recommendations
- Finding extremal sets in less than quadratic time
- Practical algorithms for finding extremal sets
- Approximately optimal algorithms for determining extrema in a certain class of functions
- Extremal problems among subsets of a set
- scientific article; zbMATH DE number 3342001
- A simple sub-quadratic algorithm for computing the subset partial order
- A quadratic lower bound for subset sums
- Fast sequential and parallel algorithms for finding extremal sets
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation
- Extremal problems among subsets of a set. (Reprint)
Cites work
Cited in
(7)- scientific article; zbMATH DE number 742985 (Why is no real title available?)
- 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
- Finding extremal sets in less than quadratic time
- Practical algorithms for finding extremal sets
- Fast sequential and parallel algorithms for finding extremal sets
This page was built for publication: An old sub-quadratic algorithm for finding extremal sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287109)