Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q3009769)
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 5912611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation |
scientific article; zbMATH DE number 5912611 |
Statements
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (English)
0 references
24 June 2011
0 references
maximum degree of minors
0 references
polynomial matrix
0 references
combinatorial relaxation algorithm
0 references
matching problem
0 references
Kronecker canonical form
0 references
matrix pencil
0 references
assignment problem
0 references
0 references
0 references
0.9999993443489076
0 references
0.9587865471839904
0 references
0.8455233573913574
0 references
0.8426539897918701
0 references
