ON THE COMPLEXITY OF SEARCHING GAME TREES AND OTHER RECURSION TREES

被引:6
|
作者
ALTHOFER, I [1 ]
机构
[1] UNIV BIELEFELD,FAK MATH,D-4800 BIELEFELD 1,FED REP GER
关键词
D O I
10.1016/0196-6774(88)90016-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:538 / 567
页数:30
相关论文
共 50 条
  • [1] SEARCHING INFORMED GAME TREES
    PIJLS, W
    DEBRUIN, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 332 - 341
  • [2] Searching game trees under memory constraints
    Bhattacharya, S
    Bagchi, A
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 222 - 227
  • [3] Searching game trees in parallel using SSS
    1600, Morgan Kaufmann Publ Inc, San Mateo, CA, USA (01):
  • [4] On the complexity of searching in trees and partially ordered structures
    Cicalese, Ferdinando
    Jacobs, Tobias
    Laber, Eduardo
    Molinaro, Marco
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) : 6879 - 6896
  • [5] Searching game trees under a partial order
    Dasgupta, P
    Chakrabarti, PP
    DeSarkar, SC
    ARTIFICIAL INTELLIGENCE, 1996, 82 (1-2) : 237 - 257
  • [6] RECURSION ON HOMOGENEOUS TREES
    JERVELL, HR
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1985, 31 (04): : 295 - 298
  • [7] On the Complexity of Searching in Trees: Average-Case Minimization
    Jacobs, Tobias
    Cicalese, Ferdinando
    Laber, Eduardo
    Molinaro, Marco
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2010, 6198 : 527 - 539
  • [8] Maximizing the chance of winning in searching Go game trees
    Chen, KH
    INFORMATION SCIENCES, 2005, 175 (04) : 273 - 283
  • [9] Searching in trees
    Recker, F
    DISCRETE APPLIED MATHEMATICS, 2004, 140 (1-3) : 169 - 183
  • [10] The complexity of algorithms computing game trees on random assignments
    Liu, ChenGuang
    Tanaka, Kazuyuki
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 241 - +