The Complexity of Algorithms Computing Game Trees on Random Assignments

DOI10.1007/978-3-540-72870-2_23zbMATH Open1137.91331OpenAlexW1536327691MaRDI QIDQ5434443

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)

Related Items (5)

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

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