Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_22 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1636771208 / rank | |||
Normal rank | |||
Revision as of 22:12, 19 March 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
