A Survey of the Distributional Complexity for AND-OR Trees

被引：0
|
作者：
Peng, Weiguang [1 ]
机构：
[1] Southwest Univ, Sch Math & Stat, Chongqing, Peoples R China
来源：
COMPUTABILITY THEORY AND FOUNDATIONS OF MATHEMATICS, CTFM 2019 | 2022年
关键词：
Game Trees; Analysis of Algorithms; Independent Distribution; Computational Complexity; INDEPENDENT DISTRIBUTIONS; SEARCH;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Liu and Tanaka (2007) first investigated the eigen-distribution, which achieves the distributional complexity for uniform binary AND-OR trees. Subsequently, several works have been done on optimal algorithms and distributional complexity on different kinds of game trees. These works contribute to the studies on the query complexity of game trees with respect to different kinds of distributions: correlated distribution, independent distribution. Here, we give a short survey on these works.
引用
收藏
页码：79 / 96
页数：18
相关论文
共 50 条
12345