COPING WITH KNOWN PATTERNS OF LIES IN A SEARCH GAME

被引:20
作者
RAVIKUMAR, B [1 ]
LAKSHMANAN, KB [1 ]
机构
[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,MADRAS 600036,TAMIL NADU,INDIA
关键词
D O I
10.1016/0304-3975(84)90104-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:85 / 94
页数:10
相关论文
共 8 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
Berlekamp E. R., 1968, Error correcting codes, P61
[3]   COUNTING APPROACH TO LOWER BOUNDS FOR SELECTION PROBLEMS [J].
FUSSENEGGER, F ;
GABOW, HN .
JOURNAL OF THE ACM, 1979, 26 (02) :227-238
[4]  
Garey M. R., 1974, Acta Informatica, V3, P347, DOI 10.1007/BF00263588
[5]  
KATONA GOH, 1973, SURVEY COMBINATORIAL, P285
[6]  
Liu C. L., 1968, INTRO COMBINATORIAL
[7]   COPING WITH ERRORS IN BINARY SEARCH PROCEDURES [J].
RIVEST, RL ;
MEYER, AR ;
KLEITMAN, DJ ;
WINKLMANN, K .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (03) :396-404
[8]   GAME OF N QUESTIONS ON A TREE [J].
RIVEST, RL .
DISCRETE MATHEMATICS, 1977, 17 (02) :181-186