Sparsification of rectangular matrices

DOI10.1006/jsco.1998.0204zbMath0908.65023OpenAlexW1967540313MaRDI QIDQ1264423

Sebastian Egner, Torsten Minkwitz

Publication date: 4 March 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0204

zbMATH Keywords

rectangular matricescombinatorial search methodoptimal sparsification

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30)

Related Items (2)

Computing sparse multiples of polynomials ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem

This page was built for publication: Sparsification of rectangular matrices