An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4112002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains |
scientific article; zbMATH DE number 4112002 |
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
0.8779371
0 references
0.8457767
0 references
0.8354681
0 references
0.8319988
0 references
0.83121467
0 references
0.8266932
0 references
0.8266823
0 references
0.8261135
0 references
