An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains |
scientific article |
Statements
An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (English)
0 references
1989
0 references
lower bound
0 references
analysis of algorithms
0 references
chain
0 references
algebraic decision trees
0 references
partial order
0 references
fixed order
0 references
