The following pages link to Twenty (simple) questions (Q4977956):
Displaying 8 items.
- Fourteen questions from the period 1965-1995 (Q1807544) (← links)
- How many random questions are necessary to identify \(n\) distinct objects? (Q1813292) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Twenty (short) questions (Q2322544) (← links)
- (Q5293232) (← links)
- Optimal Sets of Questions for Twenty Questions (Q6141868) (← links)
- Edge and pair queries-random graphs and complexity (Q6162142) (← links)