The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design (Q711399): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-008-9199-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034399496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel use of \(t\)-packings to construct \(d\)-disjunct matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pooling spaces and non-adaptive pooling designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial two-stage group testing for complexes using almost disjunct matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions of non-adaptive and error-tolerance pooling designs / rank
 
Normal rank

Latest revision as of 08:39, 3 July 2024

scientific article
Language Label Description Also known as
English
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
scientific article

    Statements

    The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design (English)
    0 references
    0 references
    0 references
    26 October 2010
    0 references
    orthogonal space
    0 references
    \(d^{z}\)-disjunct
    0 references
    arrangement problem
    0 references
    tighter analysis
    0 references
    test efficiency
    0 references

    Identifiers