Pages that link to "Item:Q754202"
From MaRDI portal
The following pages link to On separating systems whose elements are sets of at most k elements (Q754202):
Displaying 22 items.
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- Ratewise-optimal non-sequential search strategies under constraints on the tests (Q947084) (← links)
- A nonadaptive version of Ulam's problem with one lie (Q1360979) (← links)
- Completely separating systems of \(k\)-sets (Q1382833) (← links)
- Probabilistic existence theorems in group testing (Q1395870) (← links)
- Induced-bisecting families of bicolorings for hypergraphs (Q1744760) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
- Existence theorems for some group testing strategies (Q1817291) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- On separating systems with bounded set size (Q2309567) (← links)
- Identifying defective sets using queries of small size (Q2411609) (← links)
- Inclusionwise minimal completely separating systems (Q2431691) (← links)
- Minimal average cost of searching for a counterfeit coin: restricted model (Q2506364) (← links)
- Density-Based Group Testing (Q4915256) (← links)
- Minimal completely separating systems of \(k\)-sets (Q5929844) (← links)
- A combinatorial search problem on matroids (Q5957832) (← links)
- Search with small sets in presence of a liar (Q5957834) (← links)
- Separating path systems of almost linear size (Q6571612) (← links)
