Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems (Q2706294)

From MaRDI portal
Revision as of 12:09, 15 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
scientific article

    Statements

    Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems (English)
    0 references
    0 references
    19 March 2001
    0 references
    positive semidefinite matrix
    0 references
    matrix completion
    0 references
    Euclidean distance matrix
    0 references
    chordal graph
    0 references
    minimum fill-in
    0 references
    polynomial algorithm
    0 references
    bit model
    0 references
    number model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references