A Lower Bound on the Complexity of the Union-Split-Find Problem (Q3832045)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Lower Bound on the Complexity of the Union-Split-Find Problem |
scientific article; zbMATH DE number 4108151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lower Bound on the Complexity of the Union-Split-Find Problem |
scientific article; zbMATH DE number 4108151 |
Statements
A Lower Bound on the Complexity of the Union-Split-Find Problem (English)
0 references
1988
0 references
complexity
0 references
interval splitting
0 references
priority queue
0 references
union
0 references
lower bound
0 references
pointer machine
0 references
0.92285418510437
0 references
0.8612414598464966
0 references
