The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (Q915453)
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 complexity of a simple stochastic OR-tree model in which ``directional search is bad |
scientific article; zbMATH DE number 4151826
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad |
scientific article; zbMATH DE number 4151826 |
Statements
The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (English)
0 references
1990
0 references
OR-tree model
0 references
analysis of search trees
0 references
0 references
0.7489327192306519
0 references
0.7377087473869324
0 references
