Ulam's searching game with a fixed number of lies

Joel Spencer

doi:10.1016/0304-3975(92)90270-P

Ulam's searching game with a fixed number of lies

Joel Spencer

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	307-321
Number of pages	15
Journal	Theoretical Computer Science
Volume	95
Issue number	2
DOIs	https://doi.org/10.1016/0304-3975(92)90270-P
State	Published - Mar 30 1992

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/0304-3975(92)90270-P

Cite this

@article{127444f46a3b4d32805cabdc6fdfa609,

title = "Ulam's searching game with a fixed number of lies",

abstract = "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.",

author = "Joel Spencer",

year = "1992",

month = mar,

day = "30",

doi = "10.1016/0304-3975(92)90270-P",

language = "English (US)",

volume = "95",

pages = "307--321",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Ulam's searching game with a fixed number of lies

AU - Spencer, Joel

PY - 1992/3/30

Y1 - 1992/3/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026839843&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026839843&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(92)90270-P

DO - 10.1016/0304-3975(92)90270-P

M3 - Article

AN - SCOPUS:0026839843

SN - 0304-3975

VL - 95

SP - 307

EP - 321

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

Ulam's searching game with a fixed number of lies

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this