A simple sub-quadratic algorithm for computing the subset partial order (Q672836): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Three Partition Refinement Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Opportunistic algorithms for eliminating supersets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An old sub-quadratic algorithm for finding extremal sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Computing the Subset Graph of a Collection of Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast bit-parallel algorithm for computing the subset partial order / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding extremal sets in less than quadratic time / rank | |||
Normal rank | |||
Latest revision as of 10:20, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple sub-quadratic algorithm for computing the subset partial order |
scientific article |
Statements
A simple sub-quadratic algorithm for computing the subset partial order (English)
0 references
28 February 1997
0 references
Set-theoretic algorithms
0 references
Extremal sets
0 references
Subset partial order
0 references
Subset graph
0 references
Lexicographic order
0 references
Algorithms
0 references
