The following pages link to Unbounded Searching Algorithms (Q3476283):
Displaying 6 items.
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- 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)
- Unbounded search and recursive graph problems (Q5096341) (← links)
- Collection depots facility location problems in trees (Q5191128) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
