Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
A search problem involving finding a number between 1 and n using yes-no questions, with at most one lie allowed.
|
| gptkbp:field |
gptkb:combinatorics
gptkb:information_theory |
| gptkbp:firstPublished |
1976
|
| gptkbp:namedAfter |
gptkb:Stanislaw_Ulam
|
| gptkbp:notableSolutionBy |
gptkb:Andrew_Yao
|
| gptkbp:relatedTo |
gptkb:twenty_questions
error-correcting codes |
| gptkbp:bfsParent |
gptkb:Ulam's_problem_on_measure_theory
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ulam's problem
|