论文信息 - Percolation and the complexity of games

Percolation and the complexity of games

The authors establish a connection between facet of the complexity of games and the problem of percolation on the underlying tree of winning strategies. They show that the complexity is minimal for both regular and totally random trees and identify a class of trees for which it is maximal.

C. Bachas | W. F. Wolff | Constantin Bachas | W F Wolff

[1] J. W. Essam,et al. Some Cluster Size and Percolation Problems , 1961 .

[2] Huberman,et al. Complexity and the relaxation of hierarchical structures. , 1986, Physical review letters.

[3] Richard M. Karp,et al. Searching for an Optimal Path in a Tree with Random Costs , 1983, Artif. Intell..

[4] J. W. Essam,et al. Percolation theory , 1980 .

[5] Harold S. Stone,et al. The Average Complexity of Depth-First Search with Backtracking and Cutoff , 1986, IBM J. Res. Dev..

[6] T. E. Harris,et al. The Theory of Branching Processes. , 1963 .