On the complexity of non-unique probe selection (Q2474080): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5395177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410159 / rank
 
Normal rank

Latest revision as of 18:19, 27 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of non-unique probe selection
scientific article

    Statements

    On the complexity of non-unique probe selection (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    non-unique probe selection
    0 references
    separable matrices
    0 references
    DP-complete
    0 references
    \(\Sigma _2^{\text{P}}\)-complete
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers