Uniqueness of optimal randomized algorithms for balanced AND-OR trees

DOI10.14495/JSIAML.14.21MaRDI QIDQ5047116zbMATH OpenOpenAlexFDO

Authors Fuki Ito

Publication date 9 November 2022

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14495/jsiaml.14.21

zbMATH Keywords

AND-OR treecomputational complexityrandomized algorithmtransposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• A randomized competitive algorithm for evaluating priced AND/OR trees
• STACS 2004
• The eigen-distribution of weighted game trees
• Equilibrium points of an AND-OR tree: under constraints on probability
• Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees

Cites work

• An analysis of alpha-beta pruning
• Computational Complexity
• Eigen-distribution on random assignments for game trees
• scientific article; zbMATH DE number 7696296 (Why is no real title available?)
• Optimal Search on Some Game Trees

Cited in

(4)

• Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
• STACS 2004
• Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees
• A randomized competitive algorithm for evaluating priced AND/OR trees

This page was built for publication: Uniqueness of optimal randomized algorithms for balanced AND-OR trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047116)