Pages that link to "Item:Q3204043"
From MaRDI portal
The following pages link to More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (Q3204043):
Displaying 5 items.
- How many probes are needed to compute the maximum of a random walk? (Q1593629) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044) (← links)
- (Q4012993) (← links)
- (Q4871265) (← links)
- On the unsolvability of problems of guaranteed search in a sufficiently large domain (Q5954768) (← links)