The following pages link to (Q3861131):
Displayed 17 items.
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Creating order in sequence spaces with simple machines (Q751622) (← links)
- Ratewise-optimal non-sequential search strategies under constraints on the tests (Q947084) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- Optimal search paths for random variables (Q1053598) (← links)
- Universal retrieval trees (Q1068838) (← links)
- Search problems on graphs (Q1082080) (← links)
- A ternary search problem on graphs (Q1118418) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- On polychotomous search problems (Q1330533) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- Controlled search for targets arriving according to a spatio-temporal Poisson point process by an information measurement system with inhomogeneous scope (Q2052604) (← links)
- Upper and lower bounds for competitive group testing (Q2700623) (← links)
- On finding non-randomized minimax tests for statistical decision problems with applications to signal detection (Q3690001) (← links)
- A Combinatorial Model of Two-Sided Search (Q5895055) (← links)