Combinatorial relaxation algorithm for mixed polynomial matrices
From MaRDI portal
Publication:5935713
DOI10.1007/PL00011427zbMath1160.90637MaRDI QIDQ5935713
Publication date: 26 June 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (3)
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation ⋮ Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation ⋮ Legendre duality in combinatorial study of matrix pencils
This page was built for publication: Combinatorial relaxation algorithm for mixed polynomial matrices
