The Complexity of Algorithms Computing Game Trees on Random Assignments

DOI10.1007/978-3-540-72870-2_23MaRDI QIDQ5434443zbMATH OpenOpenAlexFDO

Authors Chenguang Liu, Kazuyuki Tanaka

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decision theory for games (91A35)

Recommendations

• Eigen-distribution on random assignments for game trees
• The Computational Complexity of Game Trees by Eigen-Distribution
• The eigen-distribution of weighted game trees
• scientific article; zbMATH DE number 2127728
• Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity

Cited in

(6)

• Eigen-distribution on random assignments for game trees
• The Computational Complexity of Game Trees by Eigen-Distribution
• Thick Subtrees, Games and Experiments
• The Variance of Two Game Tree Algorithms
• A game characterisation of tree-like Q-resolution size
• A Dynamic Algorithm for Reachability Games Played on Trees

This page was built for publication: The Complexity of Algorithms Computing Game Trees on Random Assignments

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