The P-matrix problem is co-NP-complete (Q1330899)

From MaRDI portal
Revision as of 10:55, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)





scientific article
Language Label Description Also known as
English
The P-matrix problem is co-NP-complete
scientific article

    Statements

    The P-matrix problem is co-NP-complete (English)
    0 references
    0 references
    10 August 1994
    0 references
    linear complementarity
    0 references
    interval matrices
    0 references
    NP-complete
    0 references
    P-matrix
    0 references

    Identifiers