The complexity of a simple stochastic OR-tree model in which ``directional search is bad

DOI10.1016/0885-064X(90)90023-7zbMath0702.68061OpenAlexW2049618906MaRDI QIDQ915453

Ingo Althöfer

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(90)90023-7

zbMATH Keywords

analysis of search treesOR-tree model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• An analysis of alpha-beta pruning
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• Optimal Search on Some Game Trees
• On the complexity of searching game trees and other recursion trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of a simple stochastic OR-tree model in which ``directional search is bad