Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems (Q2706294)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1578919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems |
scientific article; zbMATH DE number 1578919 |
Statements
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
Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems (English)
0 references
0.874517560005188
0 references
0.874517560005188
0 references
0.8661550879478455
0 references
0.8376238346099854
0 references
