Pages that link to "Item:Q2100051"
From MaRDI portal
The following pages link to A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix (Q2100051):
Displaying 3 items.
- Calculating the minimum distance of a toric code via algebraic algorithms (Q6178862) (← links)
- Generic polynomial algorithms for the knapsack problem in some matrix semigroups (Q6587364) (← links)
- Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal (Q6641147) (← links)
