The complexity of algorithms computing game trees on random assignments

Chen Guang Liu, Kazuyuki Tanaka

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

The complexity of algorithms for computing game trees on random assignments has been given substantial attention in the literature. In this line, we investigate the complexity of algorithms that compute a special class of game trees T2k from a new perspective -eigen-distribution. This particular distribution is defined as the worst distribution on assignments to variables of T2k regarding a best algorithm. In this paper, we show the eigen-distribution on assignments for T2 k in two separate cases, where the assignments to leaves are independently distributed (ID) and correlated distributed(CD). Then we use eigen-distribution to derive the tight bound of the complexity of algorithms for T2*.

本文言語English
ホスト出版物のタイトルAlgorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings
出版社Springer Verlag
ページ241-250
ページ数10
ISBN(印刷版)9783540728689
DOI
出版ステータスPublished - 2007 1 1
イベント3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007 - Portland, OR, United States
継続期間: 2007 6 62007 6 8

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4508 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007
CountryUnited States
CityPortland, OR
Period07/6/607/6/8

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「The complexity of algorithms computing game trees on random assignments」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル