Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:34, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation |
scientific article |
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
