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
来源：
JOURNAL OF ALGORITHMS | 1988年 / 9卷 / 04期
关键词：
D O I：
10.1016/0196-6774(88)90016-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：538 / 567
页数：30
相关论文
共 50 条
  • [21] Connected searching of weighted trees
    Dereniowski, Dariusz
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5700 - 5713
  • [22] On the cost of searching signature trees
    Chen, YJ
    INFORMATION PROCESSING LETTERS, 2006, 99 (01) : 19 - 26
  • [23] Searching trees with sources and targets
    Worman, Chris
    Yang, Boting
    FRONTIERS IN ALGORITHMICS, 2008, 5059 : 174 - 185
  • [24] Connected Searching of Weighted Trees
    Dereniowski, Dariusz
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 330 - 341
  • [25] BTRecurTutor: a tutorial for practicing recursion in binary trees
    Hamouda, Sally
    Edwards, Stephen H.
    Elmongui, Hicham G.
    Ernst, Jeremy V.
    Shaffer, Clifford A.
    COMPUTER SCIENCE EDUCATION, 2020, 30 (02) : 216 - 248
  • [26] CORRELATION OF BOOLEAN FUNCTIONS AND PATHOLOGY IN RECURSION TREES
    ALTHOFER, I
    LEADER, I
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (04) : 526 - 535
  • [27] ON THE COMPLEXITY OF FINDING ISOMORPHISMS AND OTHER MORPHISMS FOR PARTIAL K-TREES
    MATOUSEK, J
    THOMAS, R
    DISCRETE MATHEMATICS, 1992, 108 (1-3) : 343 - 364
  • [28] Cross-trees act like other trees
    Arnar, David O.
    LAEKNABLADID, 2020, 106 (01): : 9 - 9
  • [29] Embeddings and Other Mappings of Rooted Trees Into Complete Trees
    Nicholas Georgiou
    Order, 2005, 22 : 257 - 288
  • [30] Embeddings and other mappings of rooted trees into complete trees
    Georgiou, N
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2005, 22 (03): : 257 - 288
12345