Search cost for a nearly optimal path in a binary tree (Q835059)
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 5599224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Search cost for a nearly optimal path in a binary tree |
scientific article; zbMATH DE number 5599224 |
Statements
Search cost for a nearly optimal path in a binary tree (English)
0 references
27 August 2009
0 references
branching random walk
0 references
minimal displacement
0 references
maximal displacement
0 references
optimal path
0 references
algorithm
0 references
computational complexity
0 references
0 references
0 references
0.7896288633346558
0 references
0.74942946434021
0 references
0.74942946434021
0 references
0.7401982545852661
0 references
