Opportunistic algorithms for eliminating supersets (Q758205): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Paul A. Pritchard / rank | |||
Property / author | |||
Property / author: Paul A. Pritchard / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smoothsort, an alternative for sorting in situ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Forced termination of loops / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3925859 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for finding matrix models of propositional calculi / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Another look at the ''longest ascending subsequence'' problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear prime-number sieves: A family tree / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01261654 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2070102725 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:17, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Opportunistic algorithms for eliminating supersets |
scientific article |
Statements
Opportunistic algorithms for eliminating supersets (English)
0 references
1991
0 references
The main problem is that of finding each set in a given collection that has no proper subset in the collection. Starting with a solution that uses a quadratic (in the size of the collection) number of subset tests, solutions are developed that are opportunistic in the sense of running significantly faster for certain classes of input (such as when most sets are small), but without running slower on other input. They are based on an opportunistic algorithm for the fundamental problem of finding an element common to two ordered sequences. Methodological issues are emphasized throughout.
0 references
superset elimination
0 references
opportunistic algorithm
0 references