A randomized competitive algorithm for evaluating priced AND/OR trees

DOI10.1016/j.tcs.2008.03.033zbMath1146.68070OpenAlexW2115837137MaRDI QIDQ935154

Eduardo Sany Laber

Publication date: 31 July 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.033

zbMATH Keywords

competitive analysisrandomized algorithmsfunction evaluationAND/OR trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (3)

And/or-convexity: a graph convexity based on processes and deadlock models ⋮ Tractability, hardness, and kernelization lower bound for and/or graph solution ⋮ Revisiting the complexity of and/or graph solution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Query strategies for priced information
• Lower bounds on probabilistic linear decision trees
• An analysis of alpha-beta pruning
• Optimal Search on Some Game Trees
• The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
• On the Optimality of Randomized $\alpha$-$\beta$ Search
• LATIN 2004: Theoretical Informatics

This page was built for publication: A randomized competitive algorithm for evaluating priced AND/OR trees