The computational complexity of game trees by eigen-distribution

Chen Guang Liu, Kazuyuki Tanaka

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

3 Citations (Scopus)

Abstract

The AND-OR tree is an extremely simple model to compute the read-once Boolean functions. For an AND-OR tree, the eigen-distribution is a special distribution on random assignments to the leaves, such that the distributional complexity of the AND-OR tree is achieved. Yao's Principle[8] showed that the randomized complexity of any function is equal to the distributional complexity of the same function. In the present work, we propose an eigen-distribution- based technique to compute the distributional complexity of read-once Boolean functions. Then, combining this technique and Yao's Principle, we provide a unifying proof way for some well-known results of the randomized complexity of Boolean functions.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - First International Conference, COCOA 2007, Proceedings
Pages323-334
Number of pages12
Publication statusPublished - 2007 Dec 1
Event1st International Conference on Combinatorial Optimization and Applications, COCOA 2007 - Xi'an, China
Duration: 2007 Aug 142007 Aug 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4616 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Combinatorial Optimization and Applications, COCOA 2007
CountryChina
CityXi'an
Period07/8/1407/8/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The computational complexity of game trees by eigen-distribution'. Together they form a unique fingerprint.

Cite this