Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describedBy |
Ulam, S. M. (1976). Adventures of a Mathematician.
|
| gptkbp:field |
gptkb:combinatorics
gptkb:information_theory |
| gptkbp:firstPosed |
1976
|
| gptkbp:hasApplication |
coding theory
fault-tolerant communication |
| gptkbp:namedAfter |
gptkb:Stanislaw_Ulam
|
| gptkbp:parameter |
k (number of lies)
n (number of items) |
| gptkbp:relatedTo |
gptkb:twenty_questions
binary search with lies |
| gptkbp:solvedBy |
adaptive search
error-tolerant search |
| gptkbp:type |
How many yes-no questions are needed to identify an unknown number from 1 to n, if up to k answers may be lies?
|
| gptkbp:bfsParent |
gptkb:Ulam's_1940_problem
gptkb:Rényi–Ulam_game |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ulam's searching problem
|