Pages that link to "Item:Q5096341"
From MaRDI portal
The following pages link to Unbounded search and recursive graph problems (Q5096341):
Displaying 5 items.
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- Binary search and recursive graph problems (Q1391302) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- Finitely repeated search and the diamond paradox (Q2043130) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044) (← links)