Pages that link to "Item:Q1422408"
From MaRDI portal
The following pages link to Trivial two-stage group testing for complexes using almost disjunct matrices. (Q1422408):
Displayed 15 items.
- Almost separable matrices (Q512882) (← links)
- The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design (Q711399) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space (Q947128) (← links)
- A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters (Q1045094) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- A group testing method for finding patterns in data (Q1885819) (← links)
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (Q2369987) (← links)
- Hypothesis group testing for disjoint pairs (Q2426661) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
- ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES (Q3397514) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)