ULAMS SEARCHING GAME WITH A FIXED NUMBER OF LIES

被引：62

作者：

SPENCER, J

机构：

[1] Courant Institute of Mathematical Sciences, New York University, New York, NY 10012

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 95卷 / 02期

关键词：

D O I：

10.1016/0304-3975(92)90270-P

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Paul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole may lie up to k times. For k fixed and n, q sufficiently large, necessary and sufficient conditions are given for Paul to win.

引用

页码：307 / 321

页数：15

共 6 条

[1] ULAM SEARCHING GAME WITH LIES [J].

CZYZOWICZ, J ;

MUNDICI, D .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1989, 52 (01) :62-76

[2] ULAM SEARCHING GAME WITH 2 LIES [J].

GUZICKI, W .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1990, 54 (01) :1-19

[3]

KLEITMAN DJ, 1980, J COMPUTER SYSTEM SC, V20, P396

[4] SOLUTION OF ULAM PROBLEM ON SEARCHING WITH A LIE [J].

PELC, A .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1987, 44 (01) :129-140

[5] BALANCING GAMES [J].

SPENCER, J .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1977, 23 (01) :68-74

[6]

Ulam S. M., 1977, ADVENTURES MATH

← 1 →