The complexity of algorithms computing game trees on random assignments

Chen Guang Liu, Kazuyuki Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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*.

Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings
PublisherSpringer Verlag
Pages241-250
Number of pages10
ISBN (Print)9783540728689
DOIs
Publication statusPublished - 2007 Jan 1
Event3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007 - Portland, OR, United States
Duration: 2007 Jun 62007 Jun 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4508 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)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)

Fingerprint Dive into the research topics of 'The complexity of algorithms computing game trees on random assignments'. Together they form a unique fingerprint.

Cite this