Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems (Q2706294): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 08:07, 5 March 2024
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
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
