The following pages link to Twenty (simple) questions (Q4977956):
Displaying 5 items.
- 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)
- Optimal Sets of Questions for Twenty Questions (Q6141868) (← links)
- Edge and pair queries-random graphs and complexity (Q6162142) (← links)
- Classification via two-way comparisons (extended abstract) (Q6179419) (← links)