The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823)
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: The algorithm for identical object searching with bounded worst-case complexity and linear memory |
scientific article; zbMATH DE number 6653792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithm for identical object searching with bounded worst-case complexity and linear memory |
scientific article; zbMATH DE number 6653792 |
Statements
The algorithm for identical object searching with bounded worst-case complexity and linear memory (English)
0 references
17 November 2016
0 references
key search
0 references
time complexity of algorithms
0 references
memory size
0 references
0 references
0.8997258543968201
0 references
0.8939402103424072
0 references
0.8050954341888428
0 references
0.7101603150367737
0 references
0.6990710496902466
0 references
